./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0214_1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0214_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8cac36e956b24d42ea840a07609fb159882a2e76b1195da25a4d4343e0b31026 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:48:30,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:48:30,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:48:30,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:48:30,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:48:30,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:48:30,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:48:30,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:48:30,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:48:30,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:48:30,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:48:30,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:48:30,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:48:30,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:48:30,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:48:30,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:48:30,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:48:30,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:48:30,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:48:30,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:48:30,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:48:30,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:48:30,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:48:30,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:48:30,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:48:30,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:48:30,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:48:30,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:48:30,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:48:30,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:48:30,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:48:30,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:48:30,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:48:30,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:48:30,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:48:30,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:48:30,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:48:30,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:48:30,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:48:30,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:48:30,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:48:30,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:48:30,140 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:48:30,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:48:30,140 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:48:30,140 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:48:30,141 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:48:30,141 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:48:30,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:48:30,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:48:30,142 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:48:30,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:48:30,142 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:48:30,142 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:48:30,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:48:30,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:48:30,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:48:30,143 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:48:30,143 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:48:30,143 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:48:30,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:48:30,143 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:48:30,143 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:48:30,143 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:48:30,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:48:30,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:48:30,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:48:30,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:30,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:48:30,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:48:30,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:48:30,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:48:30,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8cac36e956b24d42ea840a07609fb159882a2e76b1195da25a4d4343e0b31026 [2022-02-20 23:48:30,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:48:30,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:48:30,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:48:30,316 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:48:30,319 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:48:30,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0214_1.i [2022-02-20 23:48:30,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c4457c7/0f3d863d4446434b89d99887b7919fb3/FLAG365e77386 [2022-02-20 23:48:30,868 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:48:30,869 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0214_1.i [2022-02-20 23:48:30,880 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c4457c7/0f3d863d4446434b89d99887b7919fb3/FLAG365e77386 [2022-02-20 23:48:31,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c4457c7/0f3d863d4446434b89d99887b7919fb3 [2022-02-20 23:48:31,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:48:31,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:48:31,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:31,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:48:31,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:48:31,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e8c253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31, skipping insertion in model container [2022-02-20 23:48:31,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:48:31,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:31,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:31,758 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:48:31,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:31,816 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:48:31,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31 WrapperNode [2022-02-20 23:48:31,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:31,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:31,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:48:31,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:48:31,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,890 INFO L137 Inliner]: procedures = 181, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2022-02-20 23:48:31,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:31,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:48:31,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:48:31,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:48:31,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:48:31,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:48:31,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:48:31,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:48:31,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:31,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:31,967 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-02-20 23:48:31,975 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-02-20 23:48:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-02-20 23:48:31,995 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-02-20 23:48:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:48:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:48:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:48:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:48:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:48:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:48:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:48:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:48:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:48:31,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:48:32,171 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:48:32,172 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:48:32,722 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:48:32,728 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:48:32,728 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:48:32,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:32 BoogieIcfgContainer [2022-02-20 23:48:32,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:48:32,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:48:32,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:48:32,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:48:32,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:48:31" (1/3) ... [2022-02-20 23:48:32,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa2c5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:32, skipping insertion in model container [2022-02-20 23:48:32,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (2/3) ... [2022-02-20 23:48:32,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa2c5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:32, skipping insertion in model container [2022-02-20 23:48:32,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:32" (3/3) ... [2022-02-20 23:48:32,739 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0214_1.i [2022-02-20 23:48:32,744 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:48:32,744 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2022-02-20 23:48:32,780 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:48:32,793 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:48:32,793 INFO L340 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2022-02-20 23:48:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 90 states have (on average 1.9222222222222223) internal successors, (173), 147 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:32,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:48:32,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:32,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:48:32,820 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:32,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1044596682, now seen corresponding path program 1 times [2022-02-20 23:48:32,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:32,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833657997] [2022-02-20 23:48:32,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:32,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:32,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {154#true} is VALID [2022-02-20 23:48:32,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {154#true} is VALID [2022-02-20 23:48:32,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume !true; {155#false} is VALID [2022-02-20 23:48:32,951 INFO L290 TraceCheckUtils]: 3: Hoare triple {155#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {155#false} is VALID [2022-02-20 23:48:32,952 INFO L290 TraceCheckUtils]: 4: Hoare triple {155#false} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {155#false} is VALID [2022-02-20 23:48:32,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {155#false} assume !(1 == #valid[~#list~0.base]); {155#false} is VALID [2022-02-20 23:48:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:32,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:32,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833657997] [2022-02-20 23:48:32,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833657997] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:32,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:32,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:32,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109417044] [2022-02-20 23:48:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:32,960 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:48:32,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:32,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:32,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:32,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:48:32,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:32,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:48:32,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:48:32,997 INFO L87 Difference]: Start difference. First operand has 151 states, 90 states have (on average 1.9222222222222223) internal successors, (173), 147 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,161 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2022-02-20 23:48:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:48:33,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:48:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 177 transitions. [2022-02-20 23:48:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 177 transitions. [2022-02-20 23:48:33,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 177 transitions. [2022-02-20 23:48:33,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:33,345 INFO L225 Difference]: With dead ends: 151 [2022-02-20 23:48:33,346 INFO L226 Difference]: Without dead ends: 148 [2022-02-20 23:48:33,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:48:33,350 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:33,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:33,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-02-20 23:48:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-02-20 23:48:33,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:33,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 148 states, 88 states have (on average 1.8636363636363635) internal successors, (164), 144 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:33,386 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 148 states, 88 states have (on average 1.8636363636363635) internal successors, (164), 144 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:33,386 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 148 states, 88 states have (on average 1.8636363636363635) internal successors, (164), 144 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,399 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2022-02-20 23:48:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2022-02-20 23:48:33,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:33,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:33,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 88 states have (on average 1.8636363636363635) internal successors, (164), 144 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 148 states. [2022-02-20 23:48:33,402 INFO L87 Difference]: Start difference. First operand has 148 states, 88 states have (on average 1.8636363636363635) internal successors, (164), 144 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 148 states. [2022-02-20 23:48:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,408 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2022-02-20 23:48:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2022-02-20 23:48:33,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:33,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:33,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:33,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 88 states have (on average 1.8636363636363635) internal successors, (164), 144 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2022-02-20 23:48:33,425 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 6 [2022-02-20 23:48:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:33,425 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2022-02-20 23:48:33,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2022-02-20 23:48:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:33,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:33,426 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:33,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:48:33,427 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:33,427 INFO L85 PathProgramCache]: Analyzing trace with hash 594339757, now seen corresponding path program 1 times [2022-02-20 23:48:33,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:33,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389424102] [2022-02-20 23:48:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:33,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:33,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {755#(= ~i~0 0)} is VALID [2022-02-20 23:48:33,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {755#(= ~i~0 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {755#(= ~i~0 0)} is VALID [2022-02-20 23:48:33,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {755#(= ~i~0 0)} main_#t~short21#1 := ~i~0 < 3; {756#|ULTIMATE.start_main_#t~short21#1|} is VALID [2022-02-20 23:48:33,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {756#|ULTIMATE.start_main_#t~short21#1|} assume !main_#t~short21#1; {754#false} is VALID [2022-02-20 23:48:33,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {754#false} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {754#false} is VALID [2022-02-20 23:48:33,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {754#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {754#false} is VALID [2022-02-20 23:48:33,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {754#false} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {754#false} is VALID [2022-02-20 23:48:33,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {754#false} assume !(1 == #valid[~#list~0.base]); {754#false} is VALID [2022-02-20 23:48:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:33,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:33,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389424102] [2022-02-20 23:48:33,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389424102] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:33,479 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:33,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:33,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923744561] [2022-02-20 23:48:33,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:33,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:48:33,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:33,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:33,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:33,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:33,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:33,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:33,500 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,806 INFO L93 Difference]: Finished difference Result 294 states and 333 transitions. [2022-02-20 23:48:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:33,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:48:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2022-02-20 23:48:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2022-02-20 23:48:33,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 334 transitions. [2022-02-20 23:48:34,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:34,066 INFO L225 Difference]: With dead ends: 294 [2022-02-20 23:48:34,067 INFO L226 Difference]: Without dead ends: 294 [2022-02-20 23:48:34,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-20 23:48:34,068 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 163 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:34,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 485 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-02-20 23:48:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 150. [2022-02-20 23:48:34,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:34,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 150 states, 90 states have (on average 1.8444444444444446) internal successors, (166), 146 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:34,075 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 150 states, 90 states have (on average 1.8444444444444446) internal successors, (166), 146 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:34,075 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 150 states, 90 states have (on average 1.8444444444444446) internal successors, (166), 146 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:34,083 INFO L93 Difference]: Finished difference Result 294 states and 333 transitions. [2022-02-20 23:48:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 333 transitions. [2022-02-20 23:48:34,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:34,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:34,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 90 states have (on average 1.8444444444444446) internal successors, (166), 146 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 294 states. [2022-02-20 23:48:34,085 INFO L87 Difference]: Start difference. First operand has 150 states, 90 states have (on average 1.8444444444444446) internal successors, (166), 146 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 294 states. [2022-02-20 23:48:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:34,094 INFO L93 Difference]: Finished difference Result 294 states and 333 transitions. [2022-02-20 23:48:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 333 transitions. [2022-02-20 23:48:34,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:34,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:34,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:34,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 90 states have (on average 1.8444444444444446) internal successors, (166), 146 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2022-02-20 23:48:34,099 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 8 [2022-02-20 23:48:34,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:34,099 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2022-02-20 23:48:34,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2022-02-20 23:48:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:34,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:34,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:34,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:48:34,100 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:34,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:34,101 INFO L85 PathProgramCache]: Analyzing trace with hash 592492715, now seen corresponding path program 1 times [2022-02-20 23:48:34,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:34,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214379901] [2022-02-20 23:48:34,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:34,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {1793#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:34,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:34,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} main_#t~short21#1 := ~i~0 < 3; {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:34,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:34,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:34,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:34,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:34,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {1795#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume !(1 == #valid[~#list~0.base]); {1794#false} is VALID [2022-02-20 23:48:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:34,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:34,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214379901] [2022-02-20 23:48:34,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214379901] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:34,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:34,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-20 23:48:34,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090019394] [2022-02-20 23:48:34,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:34,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:48:34,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:34,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:34,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:34,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:34,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:34,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:34,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:34,157 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:34,432 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2022-02-20 23:48:34,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:34,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:48:34,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-02-20 23:48:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:34,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-02-20 23:48:34,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 327 transitions. [2022-02-20 23:48:34,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:34,684 INFO L225 Difference]: With dead ends: 289 [2022-02-20 23:48:34,684 INFO L226 Difference]: Without dead ends: 289 [2022-02-20 23:48:34,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:34,685 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 148 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:34,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 223 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-02-20 23:48:34,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 203. [2022-02-20 23:48:34,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:34,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 203 states, 140 states have (on average 1.8285714285714285) internal successors, (256), 196 states have internal predecessors, (256), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:48:34,694 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 203 states, 140 states have (on average 1.8285714285714285) internal successors, (256), 196 states have internal predecessors, (256), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:48:34,694 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 203 states, 140 states have (on average 1.8285714285714285) internal successors, (256), 196 states have internal predecessors, (256), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:48:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:34,706 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2022-02-20 23:48:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 328 transitions. [2022-02-20 23:48:34,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:34,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:34,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 140 states have (on average 1.8285714285714285) internal successors, (256), 196 states have internal predecessors, (256), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 289 states. [2022-02-20 23:48:34,708 INFO L87 Difference]: Start difference. First operand has 203 states, 140 states have (on average 1.8285714285714285) internal successors, (256), 196 states have internal predecessors, (256), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 289 states. [2022-02-20 23:48:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:34,720 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2022-02-20 23:48:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 328 transitions. [2022-02-20 23:48:34,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:34,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:34,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:34,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 140 states have (on average 1.8285714285714285) internal successors, (256), 196 states have internal predecessors, (256), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:48:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 264 transitions. [2022-02-20 23:48:34,729 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 264 transitions. Word has length 8 [2022-02-20 23:48:34,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:34,729 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 264 transitions. [2022-02-20 23:48:34,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 264 transitions. [2022-02-20 23:48:34,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:34,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:34,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:34,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:48:34,730 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:34,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:34,731 INFO L85 PathProgramCache]: Analyzing trace with hash 592492716, now seen corresponding path program 1 times [2022-02-20 23:48:34,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:34,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140612597] [2022-02-20 23:48:34,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:34,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:34,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {2868#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {2870#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:34,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {2870#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {2870#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:34,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {2870#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short21#1 := ~i~0 < 3; {2870#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:34,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {2870#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {2870#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:34,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {2870#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {2870#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:34,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {2870#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {2870#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:34,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {2870#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {2871#(and (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |~#list~0.base|) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)))} is VALID [2022-02-20 23:48:34,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {2871#(and (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |~#list~0.base|) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)))} assume !(4 + (~#list~0.offset + 4 * main_~end_point~0#1) <= #length[~#list~0.base] && 0 <= ~#list~0.offset + 4 * main_~end_point~0#1); {2869#false} is VALID [2022-02-20 23:48:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:34,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:34,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140612597] [2022-02-20 23:48:34,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140612597] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:34,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:34,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:34,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656602023] [2022-02-20 23:48:34,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:34,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:48:34,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:34,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:34,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:34,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:34,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:34,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:34,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:34,850 INFO L87 Difference]: Start difference. First operand 203 states and 264 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:35,285 INFO L93 Difference]: Finished difference Result 360 states and 454 transitions. [2022-02-20 23:48:35,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:35,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:48:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 308 transitions. [2022-02-20 23:48:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 308 transitions. [2022-02-20 23:48:35,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 308 transitions. [2022-02-20 23:48:35,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:35,500 INFO L225 Difference]: With dead ends: 360 [2022-02-20 23:48:35,500 INFO L226 Difference]: Without dead ends: 360 [2022-02-20 23:48:35,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-20 23:48:35,507 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 151 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:35,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 371 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:35,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-02-20 23:48:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 288. [2022-02-20 23:48:35,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:35,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:35,525 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:35,526 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:35,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:35,535 INFO L93 Difference]: Finished difference Result 360 states and 454 transitions. [2022-02-20 23:48:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 454 transitions. [2022-02-20 23:48:35,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:35,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:35,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 360 states. [2022-02-20 23:48:35,537 INFO L87 Difference]: Start difference. First operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 360 states. [2022-02-20 23:48:35,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:35,554 INFO L93 Difference]: Finished difference Result 360 states and 454 transitions. [2022-02-20 23:48:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 454 transitions. [2022-02-20 23:48:35,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:35,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:35,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:35,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 409 transitions. [2022-02-20 23:48:35,562 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 409 transitions. Word has length 8 [2022-02-20 23:48:35,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:35,563 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 409 transitions. [2022-02-20 23:48:35,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 409 transitions. [2022-02-20 23:48:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:35,563 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:35,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:35,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:48:35,564 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:35,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash 592492778, now seen corresponding path program 1 times [2022-02-20 23:48:35,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:35,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40324315] [2022-02-20 23:48:35,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:35,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:35,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {4244#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {4246#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:35,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {4246#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {4246#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:35,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {4246#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short21#1 := ~i~0 < 3; {4246#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:35,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {4246#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {4246#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:35,670 INFO L290 TraceCheckUtils]: 4: Hoare triple {4246#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {4246#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:35,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {4246#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {4246#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:35,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {4246#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {4247#(and (<= (* ~unnamed1~0~LIST_END 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) (= (select |#length| |~#list~0.base|) 8) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)))} is VALID [2022-02-20 23:48:35,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {4247#(and (<= (* ~unnamed1~0~LIST_END 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) (= (select |#length| |~#list~0.base|) 8) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)))} assume !(4 + (~#list~0.offset + 4 * main_~end_point~0#1) <= #length[~#list~0.base] && 0 <= ~#list~0.offset + 4 * main_~end_point~0#1); {4245#false} is VALID [2022-02-20 23:48:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:35,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:35,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40324315] [2022-02-20 23:48:35,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40324315] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:35,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:35,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:35,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609897775] [2022-02-20 23:48:35,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:35,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:48:35,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:35,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:35,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:35,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:35,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:35,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:35,682 INFO L87 Difference]: Start difference. First operand 288 states and 409 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:36,160 INFO L93 Difference]: Finished difference Result 359 states and 452 transitions. [2022-02-20 23:48:36,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:36,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:48:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 307 transitions. [2022-02-20 23:48:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 307 transitions. [2022-02-20 23:48:36,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 307 transitions. [2022-02-20 23:48:36,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:36,370 INFO L225 Difference]: With dead ends: 359 [2022-02-20 23:48:36,370 INFO L226 Difference]: Without dead ends: 359 [2022-02-20 23:48:36,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-20 23:48:36,371 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 133 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:36,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 385 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-02-20 23:48:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 288. [2022-02-20 23:48:36,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:36,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:36,378 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:36,379 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:36,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:36,393 INFO L93 Difference]: Finished difference Result 359 states and 452 transitions. [2022-02-20 23:48:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 452 transitions. [2022-02-20 23:48:36,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:36,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:36,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 359 states. [2022-02-20 23:48:36,396 INFO L87 Difference]: Start difference. First operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 359 states. [2022-02-20 23:48:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:36,404 INFO L93 Difference]: Finished difference Result 359 states and 452 transitions. [2022-02-20 23:48:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 452 transitions. [2022-02-20 23:48:36,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:36,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:36,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:36,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 409 transitions. [2022-02-20 23:48:36,412 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 409 transitions. Word has length 8 [2022-02-20 23:48:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:36,412 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 409 transitions. [2022-02-20 23:48:36,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 409 transitions. [2022-02-20 23:48:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:48:36,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:36,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:36,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:48:36,413 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1364890281, now seen corresponding path program 1 times [2022-02-20 23:48:36,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:36,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737105555] [2022-02-20 23:48:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:36,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {5617#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {5617#true} is VALID [2022-02-20 23:48:36,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {5617#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} main_#t~short21#1 := ~i~0 < 3; {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,438 INFO L290 TraceCheckUtils]: 4: Hoare triple {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} SUMMARY for call main_#t~mem34#1.base, main_#t~mem34#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L751-2 {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} main_~cursor~0#1.base, main_~cursor~0#1.offset := main_#t~mem34#1.base, main_#t~mem34#1.offset;havoc main_#t~mem34#1.base, main_#t~mem34#1.offset; {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {5619#(= |ULTIMATE.start_main_~length~0#1| 0)} assume !!(main_~length~0#1 > 0); {5618#false} is VALID [2022-02-20 23:48:36,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {5618#false} assume !(1 == #valid[main_~cursor~0#1.base]); {5618#false} is VALID [2022-02-20 23:48:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:36,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:36,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737105555] [2022-02-20 23:48:36,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737105555] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:36,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:36,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:36,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532398434] [2022-02-20 23:48:36,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:36,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:48:36,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:36,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:36,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:36,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:36,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:36,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:36,455 INFO L87 Difference]: Start difference. First operand 288 states and 409 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:36,616 INFO L93 Difference]: Finished difference Result 391 states and 509 transitions. [2022-02-20 23:48:36,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:36,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:48:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 23:48:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 23:48:36,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 23:48:36,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:36,824 INFO L225 Difference]: With dead ends: 391 [2022-02-20 23:48:36,824 INFO L226 Difference]: Without dead ends: 391 [2022-02-20 23:48:36,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:36,825 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 139 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:36,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 328 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:36,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-02-20 23:48:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 290. [2022-02-20 23:48:36,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:36,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 290 states, 221 states have (on average 1.7782805429864252) internal successors, (393), 279 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:36,833 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 290 states, 221 states have (on average 1.7782805429864252) internal successors, (393), 279 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:36,833 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 290 states, 221 states have (on average 1.7782805429864252) internal successors, (393), 279 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:36,841 INFO L93 Difference]: Finished difference Result 391 states and 509 transitions. [2022-02-20 23:48:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 509 transitions. [2022-02-20 23:48:36,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:36,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:36,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 290 states, 221 states have (on average 1.7782805429864252) internal successors, (393), 279 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 391 states. [2022-02-20 23:48:36,843 INFO L87 Difference]: Start difference. First operand has 290 states, 221 states have (on average 1.7782805429864252) internal successors, (393), 279 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 391 states. [2022-02-20 23:48:36,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:36,859 INFO L93 Difference]: Finished difference Result 391 states and 509 transitions. [2022-02-20 23:48:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 509 transitions. [2022-02-20 23:48:36,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:36,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:36,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:36,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 221 states have (on average 1.7782805429864252) internal successors, (393), 279 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 409 transitions. [2022-02-20 23:48:36,866 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 409 transitions. Word has length 11 [2022-02-20 23:48:36,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:36,866 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 409 transitions. [2022-02-20 23:48:36,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 409 transitions. [2022-02-20 23:48:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:48:36,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:36,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:36,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:48:36,867 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:36,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:36,867 INFO L85 PathProgramCache]: Analyzing trace with hash 638072979, now seen corresponding path program 1 times [2022-02-20 23:48:36,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:36,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760350901] [2022-02-20 23:48:36,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:36,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:36,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {7085#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {7085#true} is VALID [2022-02-20 23:48:36,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {7085#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:36,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#t~short21#1 := ~i~0 < 3; {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:36,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:36,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:36,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:36,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:36,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} SUMMARY for call main_#t~mem34#1.base, main_#t~mem34#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L751-2 {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:36,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_~cursor~0#1.base, main_~cursor~0#1.offset := main_#t~mem34#1.base, main_#t~mem34#1.offset;havoc main_#t~mem34#1.base, main_#t~mem34#1.offset; {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:36,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(main_~length~0#1 > 0); {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:36,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:36,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {7087#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {7086#false} is VALID [2022-02-20 23:48:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:36,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:36,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760350901] [2022-02-20 23:48:36,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760350901] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:36,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:36,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:36,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083828057] [2022-02-20 23:48:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:36,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:48:36,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:36,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:36,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:36,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:36,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:36,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:36,926 INFO L87 Difference]: Start difference. First operand 290 states and 409 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,151 INFO L93 Difference]: Finished difference Result 349 states and 466 transitions. [2022-02-20 23:48:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:37,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:48:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2022-02-20 23:48:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2022-02-20 23:48:37,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 267 transitions. [2022-02-20 23:48:37,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:37,322 INFO L225 Difference]: With dead ends: 349 [2022-02-20 23:48:37,323 INFO L226 Difference]: Without dead ends: 342 [2022-02-20 23:48:37,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:37,324 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 81 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:37,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 251 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-02-20 23:48:37,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 287. [2022-02-20 23:48:37,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:37,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 287 states, 218 states have (on average 1.7798165137614679) internal successors, (388), 276 states have internal predecessors, (388), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,330 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 287 states, 218 states have (on average 1.7798165137614679) internal successors, (388), 276 states have internal predecessors, (388), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,331 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 287 states, 218 states have (on average 1.7798165137614679) internal successors, (388), 276 states have internal predecessors, (388), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,337 INFO L93 Difference]: Finished difference Result 342 states and 458 transitions. [2022-02-20 23:48:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 458 transitions. [2022-02-20 23:48:37,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:37,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:37,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 218 states have (on average 1.7798165137614679) internal successors, (388), 276 states have internal predecessors, (388), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 342 states. [2022-02-20 23:48:37,339 INFO L87 Difference]: Start difference. First operand has 287 states, 218 states have (on average 1.7798165137614679) internal successors, (388), 276 states have internal predecessors, (388), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 342 states. [2022-02-20 23:48:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,345 INFO L93 Difference]: Finished difference Result 342 states and 458 transitions. [2022-02-20 23:48:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 458 transitions. [2022-02-20 23:48:37,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:37,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:37,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:37,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 218 states have (on average 1.7798165137614679) internal successors, (388), 276 states have internal predecessors, (388), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 404 transitions. [2022-02-20 23:48:37,353 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 404 transitions. Word has length 12 [2022-02-20 23:48:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:37,353 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 404 transitions. [2022-02-20 23:48:37,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 404 transitions. [2022-02-20 23:48:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:48:37,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:37,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:37,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:48:37,354 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:37,355 INFO L85 PathProgramCache]: Analyzing trace with hash -529439982, now seen corresponding path program 1 times [2022-02-20 23:48:37,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:37,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747511143] [2022-02-20 23:48:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:37,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:37,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {8410#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {8410#true} is VALID [2022-02-20 23:48:37,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {8410#true} assume true; {8410#true} is VALID [2022-02-20 23:48:37,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8410#true} {8411#false} #285#return; {8411#false} is VALID [2022-02-20 23:48:37,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {8410#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {8410#true} is VALID [2022-02-20 23:48:37,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {8410#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {8412#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:48:37,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {8412#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~short21#1 := ~i~0 < 3; {8412#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:48:37,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {8412#(= |ULTIMATE.start_main_~y~0#1| 0)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {8412#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:48:37,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {8412#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {8412#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:48:37,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {8412#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~short23#1 := main_~y~0#1 < 5; {8413#|ULTIMATE.start_main_#t~short23#1|} is VALID [2022-02-20 23:48:37,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {8413#|ULTIMATE.start_main_#t~short23#1|} assume !main_#t~short23#1; {8411#false} is VALID [2022-02-20 23:48:37,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {8411#false} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {8411#false} is VALID [2022-02-20 23:48:37,421 INFO L272 TraceCheckUtils]: 8: Hoare triple {8411#false} call main_#t~ret24#1 := rand_end_point(); {8410#true} is VALID [2022-02-20 23:48:37,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {8410#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {8410#true} is VALID [2022-02-20 23:48:37,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {8410#true} assume true; {8410#true} is VALID [2022-02-20 23:48:37,421 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {8410#true} {8411#false} #285#return; {8411#false} is VALID [2022-02-20 23:48:37,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {8411#false} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {8411#false} is VALID [2022-02-20 23:48:37,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {8411#false} assume !(1 == #valid[append_one_~list#1.base]); {8411#false} is VALID [2022-02-20 23:48:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:37,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:37,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747511143] [2022-02-20 23:48:37,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747511143] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:37,422 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:37,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:37,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227268532] [2022-02-20 23:48:37,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:37,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:48:37,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:37,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:37,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:37,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:37,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:37,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:37,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:37,440 INFO L87 Difference]: Start difference. First operand 287 states and 404 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,743 INFO L93 Difference]: Finished difference Result 451 states and 620 transitions. [2022-02-20 23:48:37,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:37,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:48:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 306 transitions. [2022-02-20 23:48:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 306 transitions. [2022-02-20 23:48:37,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 306 transitions. [2022-02-20 23:48:37,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:37,955 INFO L225 Difference]: With dead ends: 451 [2022-02-20 23:48:37,955 INFO L226 Difference]: Without dead ends: 451 [2022-02-20 23:48:37,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-20 23:48:37,956 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 153 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:37,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 468 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-02-20 23:48:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 291. [2022-02-20 23:48:37,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:37,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 291 states, 222 states have (on average 1.7567567567567568) internal successors, (390), 280 states have internal predecessors, (390), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,969 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 291 states, 222 states have (on average 1.7567567567567568) internal successors, (390), 280 states have internal predecessors, (390), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,970 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 291 states, 222 states have (on average 1.7567567567567568) internal successors, (390), 280 states have internal predecessors, (390), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,980 INFO L93 Difference]: Finished difference Result 451 states and 620 transitions. [2022-02-20 23:48:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 620 transitions. [2022-02-20 23:48:37,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:37,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:37,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 291 states, 222 states have (on average 1.7567567567567568) internal successors, (390), 280 states have internal predecessors, (390), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 451 states. [2022-02-20 23:48:37,982 INFO L87 Difference]: Start difference. First operand has 291 states, 222 states have (on average 1.7567567567567568) internal successors, (390), 280 states have internal predecessors, (390), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 451 states. [2022-02-20 23:48:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,995 INFO L93 Difference]: Finished difference Result 451 states and 620 transitions. [2022-02-20 23:48:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 620 transitions. [2022-02-20 23:48:37,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:37,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:37,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:37,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 222 states have (on average 1.7567567567567568) internal successors, (390), 280 states have internal predecessors, (390), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 406 transitions. [2022-02-20 23:48:38,004 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 406 transitions. Word has length 14 [2022-02-20 23:48:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:38,004 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 406 transitions. [2022-02-20 23:48:38,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 406 transitions. [2022-02-20 23:48:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:48:38,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:38,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:38,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:48:38,005 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:38,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:38,005 INFO L85 PathProgramCache]: Analyzing trace with hash 279906644, now seen corresponding path program 1 times [2022-02-20 23:48:38,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:38,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298908221] [2022-02-20 23:48:38,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:38,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:38,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:38,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {10065#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {10065#true} is VALID [2022-02-20 23:48:38,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {10065#true} assume true; {10065#true} is VALID [2022-02-20 23:48:38,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10065#true} {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #285#return; {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {10065#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short21#1 := ~i~0 < 3; {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,093 INFO L290 TraceCheckUtils]: 4: Hoare triple {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short23#1 := main_~y~0#1 < 5; {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,095 INFO L272 TraceCheckUtils]: 8: Hoare triple {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret24#1 := rand_end_point(); {10065#true} is VALID [2022-02-20 23:48:38,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {10065#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {10065#true} is VALID [2022-02-20 23:48:38,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {10065#true} assume true; {10065#true} is VALID [2022-02-20 23:48:38,096 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10065#true} {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #285#return; {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {10067#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {10071#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= 3 |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:48:38,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {10071#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= 3 |ULTIMATE.start_append_one_~list#1.base|))} assume !(1 == #valid[append_one_~list#1.base]); {10066#false} is VALID [2022-02-20 23:48:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:38,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:38,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298908221] [2022-02-20 23:48:38,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298908221] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:38,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:38,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:38,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682020782] [2022-02-20 23:48:38,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:38,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:48:38,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:38,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:38,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:38,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:38,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:38,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:38,112 INFO L87 Difference]: Start difference. First operand 291 states and 406 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,730 INFO L93 Difference]: Finished difference Result 422 states and 514 transitions. [2022-02-20 23:48:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:38,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:48:38,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 411 transitions. [2022-02-20 23:48:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 411 transitions. [2022-02-20 23:48:38,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 411 transitions. [2022-02-20 23:48:39,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 411 edges. 411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:39,152 INFO L225 Difference]: With dead ends: 422 [2022-02-20 23:48:39,152 INFO L226 Difference]: Without dead ends: 422 [2022-02-20 23:48:39,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-20 23:48:39,154 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 281 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:39,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 381 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:39,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-02-20 23:48:39,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 291. [2022-02-20 23:48:39,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:39,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 422 states. Second operand has 291 states, 222 states have (on average 1.7297297297297298) internal successors, (384), 280 states have internal predecessors, (384), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:39,162 INFO L74 IsIncluded]: Start isIncluded. First operand 422 states. Second operand has 291 states, 222 states have (on average 1.7297297297297298) internal successors, (384), 280 states have internal predecessors, (384), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:39,162 INFO L87 Difference]: Start difference. First operand 422 states. Second operand has 291 states, 222 states have (on average 1.7297297297297298) internal successors, (384), 280 states have internal predecessors, (384), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,170 INFO L93 Difference]: Finished difference Result 422 states and 514 transitions. [2022-02-20 23:48:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 514 transitions. [2022-02-20 23:48:39,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:39,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:39,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 291 states, 222 states have (on average 1.7297297297297298) internal successors, (384), 280 states have internal predecessors, (384), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 422 states. [2022-02-20 23:48:39,172 INFO L87 Difference]: Start difference. First operand has 291 states, 222 states have (on average 1.7297297297297298) internal successors, (384), 280 states have internal predecessors, (384), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 422 states. [2022-02-20 23:48:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,193 INFO L93 Difference]: Finished difference Result 422 states and 514 transitions. [2022-02-20 23:48:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 514 transitions. [2022-02-20 23:48:39,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:39,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:39,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:39,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 222 states have (on average 1.7297297297297298) internal successors, (384), 280 states have internal predecessors, (384), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 400 transitions. [2022-02-20 23:48:39,200 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 400 transitions. Word has length 14 [2022-02-20 23:48:39,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:39,215 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 400 transitions. [2022-02-20 23:48:39,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 400 transitions. [2022-02-20 23:48:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:48:39,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:39,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:39,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:48:39,216 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:39,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:39,220 INFO L85 PathProgramCache]: Analyzing trace with hash 279906645, now seen corresponding path program 1 times [2022-02-20 23:48:39,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:39,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11690648] [2022-02-20 23:48:39,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:39,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:39,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {11633#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {11641#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:39,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {11641#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {11641#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:39,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11641#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #285#return; {11639#(and (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)))} is VALID [2022-02-20 23:48:39,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {11633#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short21#1 := ~i~0 < 3; {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short23#1 := main_~y~0#1 < 5; {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,356 INFO L272 TraceCheckUtils]: 8: Hoare triple {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret24#1 := rand_end_point(); {11633#true} is VALID [2022-02-20 23:48:39,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {11633#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {11641#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:39,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {11641#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {11641#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:39,359 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {11641#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {11635#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #285#return; {11639#(and (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)))} is VALID [2022-02-20 23:48:39,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {11639#(and (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {11640#(and (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:39,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {11640#(and (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume !(4 + (append_one_~list#1.offset + 4 * append_one_~to#1) <= #length[append_one_~list#1.base] && 0 <= append_one_~list#1.offset + 4 * append_one_~to#1); {11634#false} is VALID [2022-02-20 23:48:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:39,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:39,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11690648] [2022-02-20 23:48:39,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11690648] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:39,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:39,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:39,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134022497] [2022-02-20 23:48:39,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:39,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:48:39,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:39,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:39,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:39,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:39,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:39,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:39,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:39,377 INFO L87 Difference]: Start difference. First operand 291 states and 400 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,049 INFO L93 Difference]: Finished difference Result 331 states and 409 transitions. [2022-02-20 23:48:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:40,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:48:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 276 transitions. [2022-02-20 23:48:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 276 transitions. [2022-02-20 23:48:40,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 276 transitions. [2022-02-20 23:48:40,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,231 INFO L225 Difference]: With dead ends: 331 [2022-02-20 23:48:40,231 INFO L226 Difference]: Without dead ends: 331 [2022-02-20 23:48:40,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:48:40,232 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 103 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:40,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 661 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-02-20 23:48:40,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 295. [2022-02-20 23:48:40,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:40,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 295 states, 226 states have (on average 1.7212389380530972) internal successors, (389), 282 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:40,237 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 295 states, 226 states have (on average 1.7212389380530972) internal successors, (389), 282 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:40,237 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 295 states, 226 states have (on average 1.7212389380530972) internal successors, (389), 282 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,243 INFO L93 Difference]: Finished difference Result 331 states and 409 transitions. [2022-02-20 23:48:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 409 transitions. [2022-02-20 23:48:40,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 226 states have (on average 1.7212389380530972) internal successors, (389), 282 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 331 states. [2022-02-20 23:48:40,244 INFO L87 Difference]: Start difference. First operand has 295 states, 226 states have (on average 1.7212389380530972) internal successors, (389), 282 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 331 states. [2022-02-20 23:48:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,250 INFO L93 Difference]: Finished difference Result 331 states and 409 transitions. [2022-02-20 23:48:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 409 transitions. [2022-02-20 23:48:40,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:40,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 226 states have (on average 1.7212389380530972) internal successors, (389), 282 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 405 transitions. [2022-02-20 23:48:40,255 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 405 transitions. Word has length 14 [2022-02-20 23:48:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:40,255 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 405 transitions. [2022-02-20 23:48:40,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 405 transitions. [2022-02-20 23:48:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:40,256 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:40,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:40,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:48:40,256 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:40,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1443078130, now seen corresponding path program 1 times [2022-02-20 23:48:40,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:40,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136599993] [2022-02-20 23:48:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:40,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:40,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {12938#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {12938#true} is VALID [2022-02-20 23:48:40,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {12938#true} assume true; {12938#true} is VALID [2022-02-20 23:48:40,313 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12938#true} {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #287#return; {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {12938#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short21#1 := ~i~0 < 3; {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short23#1 := main_~y~0#1 < 5; {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short28#1 := main_~z~0#1 < 10; {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,319 INFO L272 TraceCheckUtils]: 11: Hoare triple {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret29#1 := rand_end_point(); {12938#true} is VALID [2022-02-20 23:48:40,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {12938#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {12938#true} is VALID [2022-02-20 23:48:40,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {12938#true} assume true; {12938#true} is VALID [2022-02-20 23:48:40,326 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12938#true} {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #287#return; {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {12940#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {12944#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1))} is VALID [2022-02-20 23:48:40,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {12944#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1))} assume !(1 == #valid[is_empty_~list#1.base]); {12939#false} is VALID [2022-02-20 23:48:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:40,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:40,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136599993] [2022-02-20 23:48:40,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136599993] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:40,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:40,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:40,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109638192] [2022-02-20 23:48:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:40,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:48:40,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:40,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:40,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:40,346 INFO L87 Difference]: Start difference. First operand 295 states and 405 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,860 INFO L93 Difference]: Finished difference Result 482 states and 619 transitions. [2022-02-20 23:48:40,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:40,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:48:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2022-02-20 23:48:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2022-02-20 23:48:40,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 404 transitions. [2022-02-20 23:48:41,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:41,065 INFO L225 Difference]: With dead ends: 482 [2022-02-20 23:48:41,065 INFO L226 Difference]: Without dead ends: 482 [2022-02-20 23:48:41,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-20 23:48:41,066 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 272 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:41,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 388 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-02-20 23:48:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 301. [2022-02-20 23:48:41,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:41,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 482 states. Second operand has 301 states, 232 states have (on average 1.7025862068965518) internal successors, (395), 288 states have internal predecessors, (395), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:41,085 INFO L74 IsIncluded]: Start isIncluded. First operand 482 states. Second operand has 301 states, 232 states have (on average 1.7025862068965518) internal successors, (395), 288 states have internal predecessors, (395), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:41,086 INFO L87 Difference]: Start difference. First operand 482 states. Second operand has 301 states, 232 states have (on average 1.7025862068965518) internal successors, (395), 288 states have internal predecessors, (395), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:41,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,097 INFO L93 Difference]: Finished difference Result 482 states and 619 transitions. [2022-02-20 23:48:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 619 transitions. [2022-02-20 23:48:41,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:41,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:41,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 232 states have (on average 1.7025862068965518) internal successors, (395), 288 states have internal predecessors, (395), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 482 states. [2022-02-20 23:48:41,100 INFO L87 Difference]: Start difference. First operand has 301 states, 232 states have (on average 1.7025862068965518) internal successors, (395), 288 states have internal predecessors, (395), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 482 states. [2022-02-20 23:48:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,110 INFO L93 Difference]: Finished difference Result 482 states and 619 transitions. [2022-02-20 23:48:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 619 transitions. [2022-02-20 23:48:41,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:41,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:41,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:41,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 232 states have (on average 1.7025862068965518) internal successors, (395), 288 states have internal predecessors, (395), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2022-02-20 23:48:41,116 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 17 [2022-02-20 23:48:41,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:41,116 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2022-02-20 23:48:41,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2022-02-20 23:48:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:41,117 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:41,117 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:41,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:48:41,117 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1443078131, now seen corresponding path program 1 times [2022-02-20 23:48:41,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:41,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056208693] [2022-02-20 23:48:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:41,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:41,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {14696#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {14696#true} is VALID [2022-02-20 23:48:41,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {14696#true} assume true; {14696#true} is VALID [2022-02-20 23:48:41,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14696#true} {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #287#return; {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {14696#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short21#1 := ~i~0 < 3; {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short23#1 := main_~y~0#1 < 5; {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short28#1 := main_~z~0#1 < 10; {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,202 INFO L272 TraceCheckUtils]: 11: Hoare triple {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret29#1 := rand_end_point(); {14696#true} is VALID [2022-02-20 23:48:41,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {14696#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {14696#true} is VALID [2022-02-20 23:48:41,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {14696#true} assume true; {14696#true} is VALID [2022-02-20 23:48:41,202 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14696#true} {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #287#return; {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:41,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {14698#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {14702#(and (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (<= |ULTIMATE.start_is_empty_~list#1.offset| 0) (<= 0 |ULTIMATE.start_is_empty_~list#1.offset|))} is VALID [2022-02-20 23:48:41,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {14702#(and (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (<= |ULTIMATE.start_is_empty_~list#1.offset| 0) (<= 0 |ULTIMATE.start_is_empty_~list#1.offset|))} assume !(4 + (is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[is_empty_~list#1.base] && 0 <= is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {14697#false} is VALID [2022-02-20 23:48:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:41,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:41,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056208693] [2022-02-20 23:48:41,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056208693] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:41,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:41,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:41,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091819408] [2022-02-20 23:48:41,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:41,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:48:41,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:41,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:41,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:41,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:41,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:41,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:41,216 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,676 INFO L93 Difference]: Finished difference Result 350 states and 431 transitions. [2022-02-20 23:48:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:41,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:48:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 297 transitions. [2022-02-20 23:48:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 297 transitions. [2022-02-20 23:48:41,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 297 transitions. [2022-02-20 23:48:41,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:41,882 INFO L225 Difference]: With dead ends: 350 [2022-02-20 23:48:41,883 INFO L226 Difference]: Without dead ends: 350 [2022-02-20 23:48:41,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-20 23:48:41,883 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 190 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:41,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 392 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-02-20 23:48:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 301. [2022-02-20 23:48:41,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:41,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand has 301 states, 232 states have (on average 1.6767241379310345) internal successors, (389), 288 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:41,890 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand has 301 states, 232 states have (on average 1.6767241379310345) internal successors, (389), 288 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:41,890 INFO L87 Difference]: Start difference. First operand 350 states. Second operand has 301 states, 232 states have (on average 1.6767241379310345) internal successors, (389), 288 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,896 INFO L93 Difference]: Finished difference Result 350 states and 431 transitions. [2022-02-20 23:48:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 431 transitions. [2022-02-20 23:48:41,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:41,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:41,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 232 states have (on average 1.6767241379310345) internal successors, (389), 288 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 350 states. [2022-02-20 23:48:41,898 INFO L87 Difference]: Start difference. First operand has 301 states, 232 states have (on average 1.6767241379310345) internal successors, (389), 288 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 350 states. [2022-02-20 23:48:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,903 INFO L93 Difference]: Finished difference Result 350 states and 431 transitions. [2022-02-20 23:48:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 431 transitions. [2022-02-20 23:48:41,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:41,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:41,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:41,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 232 states have (on average 1.6767241379310345) internal successors, (389), 288 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 405 transitions. [2022-02-20 23:48:41,909 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 405 transitions. Word has length 17 [2022-02-20 23:48:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:41,909 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 405 transitions. [2022-02-20 23:48:41,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 405 transitions. [2022-02-20 23:48:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:48:41,910 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:41,910 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:41,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:48:41,910 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:41,911 INFO L85 PathProgramCache]: Analyzing trace with hash 534459326, now seen corresponding path program 1 times [2022-02-20 23:48:41,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:41,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250696759] [2022-02-20 23:48:41,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:41,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:41,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:41,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {16058#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {16058#true} is VALID [2022-02-20 23:48:41,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {16058#true} assume true; {16058#true} is VALID [2022-02-20 23:48:41,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16058#true} {16058#true} #285#return; {16058#true} is VALID [2022-02-20 23:48:41,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {16058#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {16058#true} is VALID [2022-02-20 23:48:41,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {16058#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {16058#true} is VALID [2022-02-20 23:48:41,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {16058#true} main_#t~short21#1 := ~i~0 < 3; {16058#true} is VALID [2022-02-20 23:48:41,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {16058#true} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {16058#true} is VALID [2022-02-20 23:48:41,947 INFO L290 TraceCheckUtils]: 4: Hoare triple {16058#true} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {16058#true} is VALID [2022-02-20 23:48:41,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {16058#true} main_#t~short23#1 := main_~y~0#1 < 5; {16058#true} is VALID [2022-02-20 23:48:41,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {16058#true} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {16058#true} is VALID [2022-02-20 23:48:41,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {16058#true} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {16058#true} is VALID [2022-02-20 23:48:41,947 INFO L272 TraceCheckUtils]: 8: Hoare triple {16058#true} call main_#t~ret24#1 := rand_end_point(); {16058#true} is VALID [2022-02-20 23:48:41,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {16058#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {16058#true} is VALID [2022-02-20 23:48:41,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {16058#true} assume true; {16058#true} is VALID [2022-02-20 23:48:41,948 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {16058#true} {16058#true} #285#return; {16058#true} is VALID [2022-02-20 23:48:41,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {16058#true} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {16058#true} is VALID [2022-02-20 23:48:41,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {16058#true} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {16058#true} is VALID [2022-02-20 23:48:41,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {16058#true} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {16063#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:41,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {16063#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {16063#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:41,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {16063#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {16063#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:41,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {16063#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {16063#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:41,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {16063#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} havoc create_item_#t~switch6#1; {16063#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:41,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {16063#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !(1 == #valid[create_item_~item~0#1.base]); {16059#false} is VALID [2022-02-20 23:48:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:41,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:41,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250696759] [2022-02-20 23:48:41,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250696759] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:41,952 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:41,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:41,953 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652237903] [2022-02-20 23:48:41,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:41,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 23:48:41,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:41,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:41,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:41,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:41,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:41,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:41,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:41,975 INFO L87 Difference]: Start difference. First operand 301 states and 405 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:42,225 INFO L93 Difference]: Finished difference Result 397 states and 512 transitions. [2022-02-20 23:48:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:42,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 23:48:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2022-02-20 23:48:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2022-02-20 23:48:42,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 280 transitions. [2022-02-20 23:48:42,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:42,406 INFO L225 Difference]: With dead ends: 397 [2022-02-20 23:48:42,407 INFO L226 Difference]: Without dead ends: 397 [2022-02-20 23:48:42,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:42,408 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 141 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:42,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 281 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-02-20 23:48:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 298. [2022-02-20 23:48:42,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:42,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand has 298 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 285 states have internal predecessors, (383), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:42,415 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand has 298 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 285 states have internal predecessors, (383), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:42,416 INFO L87 Difference]: Start difference. First operand 397 states. Second operand has 298 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 285 states have internal predecessors, (383), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:42,423 INFO L93 Difference]: Finished difference Result 397 states and 512 transitions. [2022-02-20 23:48:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 512 transitions. [2022-02-20 23:48:42,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:42,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:42,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 298 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 285 states have internal predecessors, (383), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 397 states. [2022-02-20 23:48:42,424 INFO L87 Difference]: Start difference. First operand has 298 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 285 states have internal predecessors, (383), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 397 states. [2022-02-20 23:48:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:42,431 INFO L93 Difference]: Finished difference Result 397 states and 512 transitions. [2022-02-20 23:48:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 512 transitions. [2022-02-20 23:48:42,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:42,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:42,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:42,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 285 states have internal predecessors, (383), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 399 transitions. [2022-02-20 23:48:42,437 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 399 transitions. Word has length 20 [2022-02-20 23:48:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:42,437 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 399 transitions. [2022-02-20 23:48:42,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 399 transitions. [2022-02-20 23:48:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:48:42,438 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:42,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:42,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:48:42,438 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:42,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:42,438 INFO L85 PathProgramCache]: Analyzing trace with hash 534459327, now seen corresponding path program 1 times [2022-02-20 23:48:42,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:42,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271092658] [2022-02-20 23:48:42,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:42,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:42,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {17555#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {17555#true} is VALID [2022-02-20 23:48:42,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {17555#true} assume true; {17555#true} is VALID [2022-02-20 23:48:42,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17555#true} {17555#true} #285#return; {17555#true} is VALID [2022-02-20 23:48:42,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {17555#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {17555#true} is VALID [2022-02-20 23:48:42,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {17555#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {17555#true} is VALID [2022-02-20 23:48:42,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {17555#true} main_#t~short21#1 := ~i~0 < 3; {17555#true} is VALID [2022-02-20 23:48:42,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {17555#true} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {17555#true} is VALID [2022-02-20 23:48:42,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {17555#true} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {17555#true} is VALID [2022-02-20 23:48:42,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {17555#true} main_#t~short23#1 := main_~y~0#1 < 5; {17555#true} is VALID [2022-02-20 23:48:42,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {17555#true} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {17555#true} is VALID [2022-02-20 23:48:42,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {17555#true} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {17555#true} is VALID [2022-02-20 23:48:42,485 INFO L272 TraceCheckUtils]: 8: Hoare triple {17555#true} call main_#t~ret24#1 := rand_end_point(); {17555#true} is VALID [2022-02-20 23:48:42,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {17555#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {17555#true} is VALID [2022-02-20 23:48:42,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {17555#true} assume true; {17555#true} is VALID [2022-02-20 23:48:42,485 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {17555#true} {17555#true} #285#return; {17555#true} is VALID [2022-02-20 23:48:42,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {17555#true} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {17555#true} is VALID [2022-02-20 23:48:42,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {17555#true} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {17555#true} is VALID [2022-02-20 23:48:42,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {17555#true} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {17560#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:48:42,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {17560#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {17560#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:48:42,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {17560#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {17560#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:48:42,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {17560#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {17561#(and (<= (+ 265 (* 4 |ULTIMATE.start_create_item_~link_field~0#1|)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:42,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {17561#(and (<= (+ 265 (* 4 |ULTIMATE.start_create_item_~link_field~0#1|)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} havoc create_item_#t~switch6#1; {17561#(and (<= (+ 265 (* 4 |ULTIMATE.start_create_item_~link_field~0#1|)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:42,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {17561#(and (<= (+ 265 (* 4 |ULTIMATE.start_create_item_~link_field~0#1|)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume !(4 + (create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1) <= #length[create_item_~item~0#1.base] && 0 <= create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1); {17556#false} is VALID [2022-02-20 23:48:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:42,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:42,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271092658] [2022-02-20 23:48:42,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271092658] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:42,490 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:42,490 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:42,490 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380046894] [2022-02-20 23:48:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:42,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 23:48:42,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:42,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:42,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:42,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:42,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:42,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:42,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:42,505 INFO L87 Difference]: Start difference. First operand 298 states and 399 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,008 INFO L93 Difference]: Finished difference Result 517 states and 636 transitions. [2022-02-20 23:48:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:43,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 23:48:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2022-02-20 23:48:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2022-02-20 23:48:43,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 422 transitions. [2022-02-20 23:48:43,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:43,316 INFO L225 Difference]: With dead ends: 517 [2022-02-20 23:48:43,316 INFO L226 Difference]: Without dead ends: 517 [2022-02-20 23:48:43,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:43,317 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 445 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:43,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 407 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-02-20 23:48:43,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 301. [2022-02-20 23:48:43,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:43,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 517 states. Second operand has 301 states, 236 states have (on average 1.63135593220339) internal successors, (385), 288 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:43,323 INFO L74 IsIncluded]: Start isIncluded. First operand 517 states. Second operand has 301 states, 236 states have (on average 1.63135593220339) internal successors, (385), 288 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:43,323 INFO L87 Difference]: Start difference. First operand 517 states. Second operand has 301 states, 236 states have (on average 1.63135593220339) internal successors, (385), 288 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,334 INFO L93 Difference]: Finished difference Result 517 states and 636 transitions. [2022-02-20 23:48:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 636 transitions. [2022-02-20 23:48:43,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:43,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:43,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 236 states have (on average 1.63135593220339) internal successors, (385), 288 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 517 states. [2022-02-20 23:48:43,336 INFO L87 Difference]: Start difference. First operand has 301 states, 236 states have (on average 1.63135593220339) internal successors, (385), 288 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 517 states. [2022-02-20 23:48:43,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,346 INFO L93 Difference]: Finished difference Result 517 states and 636 transitions. [2022-02-20 23:48:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 636 transitions. [2022-02-20 23:48:43,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:43,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:43,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:43,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 236 states have (on average 1.63135593220339) internal successors, (385), 288 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 401 transitions. [2022-02-20 23:48:43,352 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 401 transitions. Word has length 20 [2022-02-20 23:48:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:43,352 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 401 transitions. [2022-02-20 23:48:43,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-02-20 23:48:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:48:43,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:43,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:43,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:48:43,353 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash -611630038, now seen corresponding path program 1 times [2022-02-20 23:48:43,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:43,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558458402] [2022-02-20 23:48:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:43,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:43,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:43,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {19416#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {19416#true} is VALID [2022-02-20 23:48:43,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {19416#true} assume true; {19416#true} is VALID [2022-02-20 23:48:43,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19416#true} {19416#true} #285#return; {19416#true} is VALID [2022-02-20 23:48:43,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {19416#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {19416#true} is VALID [2022-02-20 23:48:43,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {19416#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {19416#true} is VALID [2022-02-20 23:48:43,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {19416#true} main_#t~short21#1 := ~i~0 < 3; {19416#true} is VALID [2022-02-20 23:48:43,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {19416#true} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {19416#true} is VALID [2022-02-20 23:48:43,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {19416#true} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {19416#true} is VALID [2022-02-20 23:48:43,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {19416#true} main_#t~short23#1 := main_~y~0#1 < 5; {19416#true} is VALID [2022-02-20 23:48:43,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {19416#true} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {19416#true} is VALID [2022-02-20 23:48:43,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {19416#true} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {19416#true} is VALID [2022-02-20 23:48:43,413 INFO L272 TraceCheckUtils]: 8: Hoare triple {19416#true} call main_#t~ret24#1 := rand_end_point(); {19416#true} is VALID [2022-02-20 23:48:43,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {19416#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {19416#true} is VALID [2022-02-20 23:48:43,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {19416#true} assume true; {19416#true} is VALID [2022-02-20 23:48:43,413 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {19416#true} {19416#true} #285#return; {19416#true} is VALID [2022-02-20 23:48:43,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {19416#true} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {19416#true} is VALID [2022-02-20 23:48:43,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {19416#true} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {19416#true} is VALID [2022-02-20 23:48:43,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {19416#true} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {19421#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:43,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {19421#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {19421#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:43,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {19421#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {19421#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:43,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {19421#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {19422#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_PREV) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:43,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {19422#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_PREV) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} havoc create_item_#t~switch6#1; {19422#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_PREV) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:43,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {19422#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_PREV) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {19422#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_PREV) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:43,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {19422#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_PREV) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume !(4 + (create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1) <= #length[create_item_~item~0#1.base] && 0 <= create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1); {19417#false} is VALID [2022-02-20 23:48:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:43,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:43,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558458402] [2022-02-20 23:48:43,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558458402] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:43,418 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:43,418 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:43,418 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222768755] [2022-02-20 23:48:43,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:43,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-20 23:48:43,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:43,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:43,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:43,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:43,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:43,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:43,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:43,433 INFO L87 Difference]: Start difference. First operand 301 states and 401 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,965 INFO L93 Difference]: Finished difference Result 516 states and 634 transitions. [2022-02-20 23:48:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:43,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-20 23:48:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2022-02-20 23:48:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2022-02-20 23:48:43,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 419 transitions. [2022-02-20 23:48:44,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 419 edges. 419 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:44,267 INFO L225 Difference]: With dead ends: 516 [2022-02-20 23:48:44,267 INFO L226 Difference]: Without dead ends: 516 [2022-02-20 23:48:44,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:44,268 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 300 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:44,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 532 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-02-20 23:48:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 303. [2022-02-20 23:48:44,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:44,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 516 states. Second operand has 303 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 290 states have internal predecessors, (387), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:44,275 INFO L74 IsIncluded]: Start isIncluded. First operand 516 states. Second operand has 303 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 290 states have internal predecessors, (387), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:44,275 INFO L87 Difference]: Start difference. First operand 516 states. Second operand has 303 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 290 states have internal predecessors, (387), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:44,287 INFO L93 Difference]: Finished difference Result 516 states and 634 transitions. [2022-02-20 23:48:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 634 transitions. [2022-02-20 23:48:44,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:44,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:44,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 303 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 290 states have internal predecessors, (387), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 516 states. [2022-02-20 23:48:44,289 INFO L87 Difference]: Start difference. First operand has 303 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 290 states have internal predecessors, (387), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 516 states. [2022-02-20 23:48:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:44,300 INFO L93 Difference]: Finished difference Result 516 states and 634 transitions. [2022-02-20 23:48:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 634 transitions. [2022-02-20 23:48:44,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:44,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:44,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:44,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 290 states have internal predecessors, (387), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 403 transitions. [2022-02-20 23:48:44,307 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 403 transitions. Word has length 21 [2022-02-20 23:48:44,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:44,307 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 403 transitions. [2022-02-20 23:48:44,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 403 transitions. [2022-02-20 23:48:44,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:48:44,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:44,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:44,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:48:44,308 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:44,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:44,309 INFO L85 PathProgramCache]: Analyzing trace with hash -611574334, now seen corresponding path program 1 times [2022-02-20 23:48:44,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:44,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677078005] [2022-02-20 23:48:44,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:44,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:44,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:44,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {21276#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {21285#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:44,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {21285#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {21285#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:44,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21285#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {21276#true} #285#return; {21281#(<= |ULTIMATE.start_main_#t~ret24#1| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:44,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {21276#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {21276#true} is VALID [2022-02-20 23:48:44,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {21276#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {21276#true} is VALID [2022-02-20 23:48:44,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {21276#true} main_#t~short21#1 := ~i~0 < 3; {21276#true} is VALID [2022-02-20 23:48:44,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {21276#true} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {21276#true} is VALID [2022-02-20 23:48:44,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {21276#true} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {21276#true} is VALID [2022-02-20 23:48:44,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {21276#true} main_#t~short23#1 := main_~y~0#1 < 5; {21276#true} is VALID [2022-02-20 23:48:44,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {21276#true} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {21276#true} is VALID [2022-02-20 23:48:44,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {21276#true} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {21276#true} is VALID [2022-02-20 23:48:44,408 INFO L272 TraceCheckUtils]: 8: Hoare triple {21276#true} call main_#t~ret24#1 := rand_end_point(); {21276#true} is VALID [2022-02-20 23:48:44,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {21276#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {21285#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:44,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {21285#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {21285#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:44,413 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {21285#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {21276#true} #285#return; {21281#(<= |ULTIMATE.start_main_#t~ret24#1| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:44,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {21281#(<= |ULTIMATE.start_main_#t~ret24#1| ~unnamed1~0~LIST_BEG)} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {21282#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:44,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {21282#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_append_one_~to#1|))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {21282#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:44,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {21282#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_append_one_~to#1|))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {21283#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:48:44,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {21283#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {21283#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:48:44,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {21283#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {21283#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:48:44,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {21283#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} assume !create_item_#t~switch6#1;create_item_#t~switch6#1 := create_item_#t~switch6#1 || create_item_~at#1 == ~unnamed1~0~LIST_END; {21284#(not |ULTIMATE.start_create_item_#t~switch6#1|)} is VALID [2022-02-20 23:48:44,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {21284#(not |ULTIMATE.start_create_item_#t~switch6#1|)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_PREV;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_NEXT; {21277#false} is VALID [2022-02-20 23:48:44,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {21277#false} havoc create_item_#t~switch6#1; {21277#false} is VALID [2022-02-20 23:48:44,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {21277#false} assume !(4 + (create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1) <= #length[create_item_~item~0#1.base] && 0 <= create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1); {21277#false} is VALID [2022-02-20 23:48:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:44,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:44,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677078005] [2022-02-20 23:48:44,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677078005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:44,425 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:44,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:48:44,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005449647] [2022-02-20 23:48:44,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:44,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-20 23:48:44,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:44,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:44,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:44,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:44,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:44,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:44,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:44,440 INFO L87 Difference]: Start difference. First operand 303 states and 403 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:44,986 INFO L93 Difference]: Finished difference Result 336 states and 405 transitions. [2022-02-20 23:48:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:48:44,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-20 23:48:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:44,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 267 transitions. [2022-02-20 23:48:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 267 transitions. [2022-02-20 23:48:44,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 267 transitions. [2022-02-20 23:48:45,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:45,165 INFO L225 Difference]: With dead ends: 336 [2022-02-20 23:48:45,165 INFO L226 Difference]: Without dead ends: 336 [2022-02-20 23:48:45,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:45,166 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 348 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:45,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 1144 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-02-20 23:48:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 303. [2022-02-20 23:48:45,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:45,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 303 states, 238 states have (on average 1.6176470588235294) internal successors, (385), 290 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:45,171 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 303 states, 238 states have (on average 1.6176470588235294) internal successors, (385), 290 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:45,171 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 303 states, 238 states have (on average 1.6176470588235294) internal successors, (385), 290 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:45,176 INFO L93 Difference]: Finished difference Result 336 states and 405 transitions. [2022-02-20 23:48:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 405 transitions. [2022-02-20 23:48:45,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:45,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:45,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 303 states, 238 states have (on average 1.6176470588235294) internal successors, (385), 290 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 336 states. [2022-02-20 23:48:45,177 INFO L87 Difference]: Start difference. First operand has 303 states, 238 states have (on average 1.6176470588235294) internal successors, (385), 290 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 336 states. [2022-02-20 23:48:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:45,183 INFO L93 Difference]: Finished difference Result 336 states and 405 transitions. [2022-02-20 23:48:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 405 transitions. [2022-02-20 23:48:45,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:45,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:45,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:45,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 238 states have (on average 1.6176470588235294) internal successors, (385), 290 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 401 transitions. [2022-02-20 23:48:45,188 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 401 transitions. Word has length 21 [2022-02-20 23:48:45,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:45,189 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 401 transitions. [2022-02-20 23:48:45,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 401 transitions. [2022-02-20 23:48:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:48:45,189 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:45,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:45,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:48:45,190 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:45,190 INFO L85 PathProgramCache]: Analyzing trace with hash -611572412, now seen corresponding path program 1 times [2022-02-20 23:48:45,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:45,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806172942] [2022-02-20 23:48:45,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:45,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:45,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {22608#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {22617#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:45,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {22617#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {22617#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:45,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22617#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {22608#true} #285#return; {22613#(and (<= |ULTIMATE.start_main_#t~ret24#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret24#1|))} is VALID [2022-02-20 23:48:45,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {22608#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {22608#true} is VALID [2022-02-20 23:48:45,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {22608#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {22608#true} is VALID [2022-02-20 23:48:45,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {22608#true} main_#t~short21#1 := ~i~0 < 3; {22608#true} is VALID [2022-02-20 23:48:45,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {22608#true} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {22608#true} is VALID [2022-02-20 23:48:45,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {22608#true} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {22608#true} is VALID [2022-02-20 23:48:45,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {22608#true} main_#t~short23#1 := main_~y~0#1 < 5; {22608#true} is VALID [2022-02-20 23:48:45,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {22608#true} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {22608#true} is VALID [2022-02-20 23:48:45,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {22608#true} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {22608#true} is VALID [2022-02-20 23:48:45,277 INFO L272 TraceCheckUtils]: 8: Hoare triple {22608#true} call main_#t~ret24#1 := rand_end_point(); {22608#true} is VALID [2022-02-20 23:48:45,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {22608#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {22617#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:45,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {22617#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {22617#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:45,279 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {22617#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {22608#true} #285#return; {22613#(and (<= |ULTIMATE.start_main_#t~ret24#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret24#1|))} is VALID [2022-02-20 23:48:45,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {22613#(and (<= |ULTIMATE.start_main_#t~ret24#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret24#1|))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {22614#(and (<= |ULTIMATE.start_append_one_~to#1| ~unnamed1~0~LIST_BEG) (< 0 (+ 1 |ULTIMATE.start_append_one_~to#1|)))} is VALID [2022-02-20 23:48:45,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {22614#(and (<= |ULTIMATE.start_append_one_~to#1| ~unnamed1~0~LIST_BEG) (< 0 (+ 1 |ULTIMATE.start_append_one_~to#1|)))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {22614#(and (<= |ULTIMATE.start_append_one_~to#1| ~unnamed1~0~LIST_BEG) (< 0 (+ 1 |ULTIMATE.start_append_one_~to#1|)))} is VALID [2022-02-20 23:48:45,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {22614#(and (<= |ULTIMATE.start_append_one_~to#1| ~unnamed1~0~LIST_BEG) (< 0 (+ 1 |ULTIMATE.start_append_one_~to#1|)))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {22615#(= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:48:45,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {22615#(= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {22615#(= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:48:45,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {22615#(= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {22616#|ULTIMATE.start_create_item_#t~switch6#1|} is VALID [2022-02-20 23:48:45,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {22616#|ULTIMATE.start_create_item_#t~switch6#1|} assume !create_item_#t~switch6#1;create_item_#t~switch6#1 := create_item_#t~switch6#1 || create_item_~at#1 == ~unnamed1~0~LIST_END; {22609#false} is VALID [2022-02-20 23:48:45,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {22609#false} assume !create_item_#t~switch6#1; {22609#false} is VALID [2022-02-20 23:48:45,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {22609#false} havoc create_item_#t~switch6#1; {22609#false} is VALID [2022-02-20 23:48:45,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {22609#false} assume !(4 + (create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1) <= #length[create_item_~item~0#1.base] && 0 <= create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1); {22609#false} is VALID [2022-02-20 23:48:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:45,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:45,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806172942] [2022-02-20 23:48:45,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806172942] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:45,283 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:45,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:48:45,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204202005] [2022-02-20 23:48:45,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:45,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-20 23:48:45,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:45,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:45,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:45,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:45,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:45,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:45,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:45,306 INFO L87 Difference]: Start difference. First operand 303 states and 401 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:45,885 INFO L93 Difference]: Finished difference Result 326 states and 391 transitions. [2022-02-20 23:48:45,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:48:45,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-20 23:48:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 262 transitions. [2022-02-20 23:48:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 262 transitions. [2022-02-20 23:48:45,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 262 transitions. [2022-02-20 23:48:46,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:46,063 INFO L225 Difference]: With dead ends: 326 [2022-02-20 23:48:46,063 INFO L226 Difference]: Without dead ends: 326 [2022-02-20 23:48:46,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:46,064 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 337 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:46,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 1134 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-02-20 23:48:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 293. [2022-02-20 23:48:46,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:46,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand has 293 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 280 states have internal predecessors, (371), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:46,068 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand has 293 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 280 states have internal predecessors, (371), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:46,068 INFO L87 Difference]: Start difference. First operand 326 states. Second operand has 293 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 280 states have internal predecessors, (371), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:46,072 INFO L93 Difference]: Finished difference Result 326 states and 391 transitions. [2022-02-20 23:48:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 391 transitions. [2022-02-20 23:48:46,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:46,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:46,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 280 states have internal predecessors, (371), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 326 states. [2022-02-20 23:48:46,074 INFO L87 Difference]: Start difference. First operand has 293 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 280 states have internal predecessors, (371), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 326 states. [2022-02-20 23:48:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:46,078 INFO L93 Difference]: Finished difference Result 326 states and 391 transitions. [2022-02-20 23:48:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 391 transitions. [2022-02-20 23:48:46,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:46,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:46,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:46,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 280 states have internal predecessors, (371), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 387 transitions. [2022-02-20 23:48:46,082 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 387 transitions. Word has length 21 [2022-02-20 23:48:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:46,083 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 387 transitions. [2022-02-20 23:48:46,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 387 transitions. [2022-02-20 23:48:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:48:46,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:46,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:46,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:48:46,084 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:46,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1215813558, now seen corresponding path program 1 times [2022-02-20 23:48:46,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:46,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647517648] [2022-02-20 23:48:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:46,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:46,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {23900#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {23900#true} is VALID [2022-02-20 23:48:46,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {23900#true} assume true; {23900#true} is VALID [2022-02-20 23:48:46,375 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23900#true} {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #287#return; {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {23900#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short21#1 := ~i~0 < 3; {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short23#1 := main_~y~0#1 < 5; {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short28#1 := main_~z~0#1 < 10; {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,382 INFO L272 TraceCheckUtils]: 11: Hoare triple {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} call main_#t~ret29#1 := rand_end_point(); {23900#true} is VALID [2022-02-20 23:48:46,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {23900#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {23900#true} is VALID [2022-02-20 23:48:46,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {23900#true} assume true; {23900#true} is VALID [2022-02-20 23:48:46,383 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {23900#true} {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #287#return; {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {23902#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= ~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {23906#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (= ~i~0 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0)) (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is VALID [2022-02-20 23:48:46,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {23906#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (= ~i~0 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0)) (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {23907#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= ~i~0 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_#t~mem3#1.base| 0) (= 0 |ULTIMATE.start_is_empty_#t~mem3#1.offset|)) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is VALID [2022-02-20 23:48:46,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {23907#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= ~i~0 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_#t~mem3#1.base| 0) (= 0 |ULTIMATE.start_is_empty_#t~mem3#1.offset|)) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {23908#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= ~i~0 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is VALID [2022-02-20 23:48:46,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {23908#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= ~i~0 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {23909#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (and (= |ULTIMATE.start_is_empty_#t~mem4#1.base| 0) (= ~i~0 0) (= |ULTIMATE.start_is_empty_#t~mem4#1.offset| 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is VALID [2022-02-20 23:48:46,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {23909#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (and (= |ULTIMATE.start_is_empty_#t~mem4#1.base| 0) (= ~i~0 0) (= |ULTIMATE.start_is_empty_#t~mem4#1.offset| 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {23910#(or (and (= |ULTIMATE.start_is_empty_~no_end~0#1| |ULTIMATE.start_is_empty_~no_beg~0#1|) (= ~i~0 0)) (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is VALID [2022-02-20 23:48:46,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {23910#(or (and (= |ULTIMATE.start_is_empty_~no_end~0#1| |ULTIMATE.start_is_empty_~no_beg~0#1|) (= ~i~0 0)) (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} assume is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10; {23911#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is VALID [2022-02-20 23:48:46,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {23911#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} assume 0 == is_empty_~list#1.offset; {23901#false} is VALID [2022-02-20 23:48:46,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {23901#false} assume !(is_empty_~list#1.base < #StackHeapBarrier); {23901#false} is VALID [2022-02-20 23:48:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:46,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:46,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647517648] [2022-02-20 23:48:46,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647517648] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:46,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:46,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:48:46,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758602387] [2022-02-20 23:48:46,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:46,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-20 23:48:46,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:46,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:46,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:46,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:48:46,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:46,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:48:46,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:48:46,412 INFO L87 Difference]: Start difference. First operand 293 states and 387 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:47,864 INFO L93 Difference]: Finished difference Result 410 states and 523 transitions. [2022-02-20 23:48:47,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:48:47,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-20 23:48:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 275 transitions. [2022-02-20 23:48:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 275 transitions. [2022-02-20 23:48:47,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 275 transitions. [2022-02-20 23:48:48,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:48,059 INFO L225 Difference]: With dead ends: 410 [2022-02-20 23:48:48,060 INFO L226 Difference]: Without dead ends: 408 [2022-02-20 23:48:48,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:48:48,060 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 253 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:48,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 905 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:48:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-02-20 23:48:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 345. [2022-02-20 23:48:48,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:48,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 408 states. Second operand has 345 states, 277 states have (on average 1.5884476534296028) internal successors, (440), 328 states have internal predecessors, (440), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:48:48,065 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand has 345 states, 277 states have (on average 1.5884476534296028) internal successors, (440), 328 states have internal predecessors, (440), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:48:48,066 INFO L87 Difference]: Start difference. First operand 408 states. Second operand has 345 states, 277 states have (on average 1.5884476534296028) internal successors, (440), 328 states have internal predecessors, (440), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:48:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:48,075 INFO L93 Difference]: Finished difference Result 408 states and 521 transitions. [2022-02-20 23:48:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 521 transitions. [2022-02-20 23:48:48,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:48,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:48,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 277 states have (on average 1.5884476534296028) internal successors, (440), 328 states have internal predecessors, (440), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 408 states. [2022-02-20 23:48:48,078 INFO L87 Difference]: Start difference. First operand has 345 states, 277 states have (on average 1.5884476534296028) internal successors, (440), 328 states have internal predecessors, (440), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 408 states. [2022-02-20 23:48:48,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:48,088 INFO L93 Difference]: Finished difference Result 408 states and 521 transitions. [2022-02-20 23:48:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 521 transitions. [2022-02-20 23:48:48,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:48,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:48,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:48,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 277 states have (on average 1.5884476534296028) internal successors, (440), 328 states have internal predecessors, (440), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:48:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 462 transitions. [2022-02-20 23:48:48,096 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 462 transitions. Word has length 23 [2022-02-20 23:48:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:48,096 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 462 transitions. [2022-02-20 23:48:48,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:48,097 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 462 transitions. [2022-02-20 23:48:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:48:48,097 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:48,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:48,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:48:48,097 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash 173365089, now seen corresponding path program 1 times [2022-02-20 23:48:48,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:48,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310947535] [2022-02-20 23:48:48,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:48,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:48,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:48,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {25497#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {25497#true} is VALID [2022-02-20 23:48:48,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {25497#true} assume true; {25497#true} is VALID [2022-02-20 23:48:48,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25497#true} {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #287#return; {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {25497#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short21#1 := ~i~0 < 3; {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,137 INFO L290 TraceCheckUtils]: 4: Hoare triple {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short23#1 := main_~y~0#1 < 5; {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short28#1 := main_~z~0#1 < 10; {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,139 INFO L272 TraceCheckUtils]: 11: Hoare triple {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret29#1 := rand_end_point(); {25497#true} is VALID [2022-02-20 23:48:48,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {25497#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {25497#true} is VALID [2022-02-20 23:48:48,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {25497#true} assume true; {25497#true} is VALID [2022-02-20 23:48:48,140 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {25497#true} {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #287#return; {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:48,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {25499#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:48,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:48,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:48,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:48,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:48,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10); {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:48,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is_empty_#res#1 := is_empty_~no_beg~0#1; {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:48,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} remove_one_#t~ret11#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret11#1 && remove_one_#t~ret11#1 <= 2147483647; {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:48,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} assume !(0 != remove_one_#t~ret11#1);havoc remove_one_#t~ret11#1; {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:48,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {25503#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} assume !(1 == #valid[remove_one_~list#1.base]); {25498#false} is VALID [2022-02-20 23:48:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:48,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:48,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310947535] [2022-02-20 23:48:48,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310947535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:48,145 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:48,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:48,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676562398] [2022-02-20 23:48:48,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:48,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 23:48:48,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:48,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:48,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:48,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:48,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:48,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:48,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:48,163 INFO L87 Difference]: Start difference. First operand 345 states and 462 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:48,655 INFO L93 Difference]: Finished difference Result 520 states and 673 transitions. [2022-02-20 23:48:48,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:48,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 23:48:48,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2022-02-20 23:48:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2022-02-20 23:48:48,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 374 transitions. [2022-02-20 23:48:48,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:48,933 INFO L225 Difference]: With dead ends: 520 [2022-02-20 23:48:48,933 INFO L226 Difference]: Without dead ends: 520 [2022-02-20 23:48:48,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-20 23:48:48,934 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 236 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:48,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 372 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-02-20 23:48:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 377. [2022-02-20 23:48:48,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:48,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 520 states. Second operand has 377 states, 309 states have (on average 1.6181229773462784) internal successors, (500), 360 states have internal predecessors, (500), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:48:48,941 INFO L74 IsIncluded]: Start isIncluded. First operand 520 states. Second operand has 377 states, 309 states have (on average 1.6181229773462784) internal successors, (500), 360 states have internal predecessors, (500), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:48:48,941 INFO L87 Difference]: Start difference. First operand 520 states. Second operand has 377 states, 309 states have (on average 1.6181229773462784) internal successors, (500), 360 states have internal predecessors, (500), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:48:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:48,951 INFO L93 Difference]: Finished difference Result 520 states and 673 transitions. [2022-02-20 23:48:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 673 transitions. [2022-02-20 23:48:48,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:48,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:48,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 309 states have (on average 1.6181229773462784) internal successors, (500), 360 states have internal predecessors, (500), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 520 states. [2022-02-20 23:48:48,952 INFO L87 Difference]: Start difference. First operand has 377 states, 309 states have (on average 1.6181229773462784) internal successors, (500), 360 states have internal predecessors, (500), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 520 states. [2022-02-20 23:48:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:48,962 INFO L93 Difference]: Finished difference Result 520 states and 673 transitions. [2022-02-20 23:48:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 673 transitions. [2022-02-20 23:48:48,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:48,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:48,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:48,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 309 states have (on average 1.6181229773462784) internal successors, (500), 360 states have internal predecessors, (500), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:48:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 522 transitions. [2022-02-20 23:48:48,970 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 522 transitions. Word has length 25 [2022-02-20 23:48:48,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:48,970 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 522 transitions. [2022-02-20 23:48:48,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 522 transitions. [2022-02-20 23:48:48,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:48:48,970 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:48,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:48,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:48:48,971 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:48,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:48,971 INFO L85 PathProgramCache]: Analyzing trace with hash 173365090, now seen corresponding path program 1 times [2022-02-20 23:48:48,971 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:48,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352765985] [2022-02-20 23:48:48,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:48,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:49,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:49,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {27445#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {27445#true} is VALID [2022-02-20 23:48:49,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {27445#true} assume true; {27445#true} is VALID [2022-02-20 23:48:49,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27445#true} {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #287#return; {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {27445#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short21#1 := ~i~0 < 3; {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short23#1 := main_~y~0#1 < 5; {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short28#1 := main_~z~0#1 < 10; {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,108 INFO L272 TraceCheckUtils]: 11: Hoare triple {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} call main_#t~ret29#1 := rand_end_point(); {27445#true} is VALID [2022-02-20 23:48:49,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {27445#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {27445#true} is VALID [2022-02-20 23:48:49,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {27445#true} assume true; {27445#true} is VALID [2022-02-20 23:48:49,108 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {27445#true} {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #287#return; {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:49,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {27447#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {27451#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:48:49,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {27451#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {27452#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:48:49,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {27452#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {27452#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:48:49,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {27452#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {27453#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:49,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {27453#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {27453#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:49,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {27453#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10); {27453#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:49,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {27453#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is_empty_#res#1 := is_empty_~no_beg~0#1; {27453#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:49,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {27453#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} remove_one_#t~ret11#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret11#1 && remove_one_#t~ret11#1 <= 2147483647; {27453#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:49,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {27453#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(0 != remove_one_#t~ret11#1);havoc remove_one_#t~ret11#1; {27453#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:49,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {27453#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(4 + (remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[remove_one_~list#1.base] && 0 <= remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {27446#false} is VALID [2022-02-20 23:48:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:49,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:49,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352765985] [2022-02-20 23:48:49,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352765985] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:49,115 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:49,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:49,115 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761560561] [2022-02-20 23:48:49,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:49,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 23:48:49,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:49,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:49,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:49,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:49,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:49,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:49,135 INFO L87 Difference]: Start difference. First operand 377 states and 522 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:49,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:49,810 INFO L93 Difference]: Finished difference Result 428 states and 544 transitions. [2022-02-20 23:48:49,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:49,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 23:48:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2022-02-20 23:48:49,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2022-02-20 23:48:49,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 285 transitions. [2022-02-20 23:48:50,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:50,027 INFO L225 Difference]: With dead ends: 428 [2022-02-20 23:48:50,027 INFO L226 Difference]: Without dead ends: 428 [2022-02-20 23:48:50,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:48:50,028 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 357 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:50,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 466 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-02-20 23:48:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 377. [2022-02-20 23:48:50,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:50,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 377 states, 309 states have (on average 1.5792880258899675) internal successors, (488), 360 states have internal predecessors, (488), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:48:50,033 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 377 states, 309 states have (on average 1.5792880258899675) internal successors, (488), 360 states have internal predecessors, (488), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:48:50,033 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 377 states, 309 states have (on average 1.5792880258899675) internal successors, (488), 360 states have internal predecessors, (488), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:48:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:50,040 INFO L93 Difference]: Finished difference Result 428 states and 544 transitions. [2022-02-20 23:48:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 544 transitions. [2022-02-20 23:48:50,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:50,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:50,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 309 states have (on average 1.5792880258899675) internal successors, (488), 360 states have internal predecessors, (488), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 428 states. [2022-02-20 23:48:50,042 INFO L87 Difference]: Start difference. First operand has 377 states, 309 states have (on average 1.5792880258899675) internal successors, (488), 360 states have internal predecessors, (488), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 428 states. [2022-02-20 23:48:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:50,049 INFO L93 Difference]: Finished difference Result 428 states and 544 transitions. [2022-02-20 23:48:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 544 transitions. [2022-02-20 23:48:50,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:50,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:50,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:50,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 309 states have (on average 1.5792880258899675) internal successors, (488), 360 states have internal predecessors, (488), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:48:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 510 transitions. [2022-02-20 23:48:50,055 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 510 transitions. Word has length 25 [2022-02-20 23:48:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:50,055 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 510 transitions. [2022-02-20 23:48:50,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 510 transitions. [2022-02-20 23:48:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:48:50,056 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:50,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:50,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:48:50,056 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:50,057 INFO L85 PathProgramCache]: Analyzing trace with hash -560017875, now seen corresponding path program 1 times [2022-02-20 23:48:50,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:50,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500019847] [2022-02-20 23:48:50,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:50,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:50,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {29123#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {29123#true} is VALID [2022-02-20 23:48:50,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {29123#true} assume true; {29123#true} is VALID [2022-02-20 23:48:50,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29123#true} {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #285#return; {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:50,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {29123#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:50,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:50,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short21#1 := ~i~0 < 3; {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:50,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:50,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:50,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short23#1 := main_~y~0#1 < 5; {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:50,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:50,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:50,194 INFO L272 TraceCheckUtils]: 8: Hoare triple {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} call main_#t~ret24#1 := rand_end_point(); {29123#true} is VALID [2022-02-20 23:48:50,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {29123#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {29123#true} is VALID [2022-02-20 23:48:50,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {29123#true} assume true; {29123#true} is VALID [2022-02-20 23:48:50,195 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29123#true} {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #285#return; {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:50,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {29125#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {29129#(and (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|)) 0)) (not (= (+ ~unnamed1~0~LIST_BEG (* (- 1) |ULTIMATE.start_append_one_~to#1|)) 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:48:50,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {29129#(and (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|)) 0)) (not (= (+ ~unnamed1~0~LIST_BEG (* (- 1) |ULTIMATE.start_append_one_~to#1|)) 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {29130#(or (and (= |ULTIMATE.start_append_one_#t~mem7#1.offset| 0) (= |ULTIMATE.start_append_one_#t~mem7#1.base| 0)) (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|)))} is VALID [2022-02-20 23:48:50,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {29130#(or (and (= |ULTIMATE.start_append_one_#t~mem7#1.offset| 0) (= |ULTIMATE.start_append_one_#t~mem7#1.base| 0)) (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|)))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {29131#(or (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)) (and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0)))} is VALID [2022-02-20 23:48:50,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {29131#(or (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)) (and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0)))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {29131#(or (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)) (and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0)))} is VALID [2022-02-20 23:48:50,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {29131#(or (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)) (and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0)))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {29132#(or (not |ULTIMATE.start_create_item_#t~switch6#1|) (and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0)))} is VALID [2022-02-20 23:48:50,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {29132#(or (not |ULTIMATE.start_create_item_#t~switch6#1|) (and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0)))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {29133#(and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0))} is VALID [2022-02-20 23:48:50,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {29133#(and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0))} havoc create_item_#t~switch6#1; {29133#(and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0))} is VALID [2022-02-20 23:48:50,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {29133#(and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {29133#(and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0))} is VALID [2022-02-20 23:48:50,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {29133#(and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {29133#(and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0))} is VALID [2022-02-20 23:48:50,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {29133#(and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {29133#(and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0))} is VALID [2022-02-20 23:48:50,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {29133#(and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {29133#(and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0))} is VALID [2022-02-20 23:48:50,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {29133#(and (= |ULTIMATE.start_create_item_~link#1.base| 0) (= |ULTIMATE.start_create_item_~link#1.offset| 0))} assume create_item_~link#1.base != 0 || create_item_~link#1.offset != 0; {29124#false} is VALID [2022-02-20 23:48:50,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {29124#false} assume !(1 == #valid[create_item_~link#1.base]); {29124#false} is VALID [2022-02-20 23:48:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:50,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:50,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500019847] [2022-02-20 23:48:50,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500019847] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:50,202 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:50,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:48:50,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238803740] [2022-02-20 23:48:50,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:50,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 23:48:50,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:50,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:50,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:50,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:48:50,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:50,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:48:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:50,225 INFO L87 Difference]: Start difference. First operand 377 states and 510 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:51,347 INFO L93 Difference]: Finished difference Result 667 states and 867 transitions. [2022-02-20 23:48:51,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:48:51,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 23:48:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 408 transitions. [2022-02-20 23:48:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 408 transitions. [2022-02-20 23:48:51,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 408 transitions. [2022-02-20 23:48:51,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:51,654 INFO L225 Difference]: With dead ends: 667 [2022-02-20 23:48:51,654 INFO L226 Difference]: Without dead ends: 667 [2022-02-20 23:48:51,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:48:51,655 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 531 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:51,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 1214 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-02-20 23:48:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 439. [2022-02-20 23:48:51,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:51,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand has 439 states, 368 states have (on average 1.546195652173913) internal successors, (569), 419 states have internal predecessors, (569), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:48:51,661 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand has 439 states, 368 states have (on average 1.546195652173913) internal successors, (569), 419 states have internal predecessors, (569), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:48:51,661 INFO L87 Difference]: Start difference. First operand 667 states. Second operand has 439 states, 368 states have (on average 1.546195652173913) internal successors, (569), 419 states have internal predecessors, (569), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:48:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:51,674 INFO L93 Difference]: Finished difference Result 667 states and 867 transitions. [2022-02-20 23:48:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 867 transitions. [2022-02-20 23:48:51,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:51,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:51,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 439 states, 368 states have (on average 1.546195652173913) internal successors, (569), 419 states have internal predecessors, (569), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 667 states. [2022-02-20 23:48:51,676 INFO L87 Difference]: Start difference. First operand has 439 states, 368 states have (on average 1.546195652173913) internal successors, (569), 419 states have internal predecessors, (569), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 667 states. [2022-02-20 23:48:51,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:51,688 INFO L93 Difference]: Finished difference Result 667 states and 867 transitions. [2022-02-20 23:48:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 867 transitions. [2022-02-20 23:48:51,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:51,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:51,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:51,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 368 states have (on average 1.546195652173913) internal successors, (569), 419 states have internal predecessors, (569), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:48:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 595 transitions. [2022-02-20 23:48:51,695 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 595 transitions. Word has length 25 [2022-02-20 23:48:51,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:51,695 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 595 transitions. [2022-02-20 23:48:51,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 595 transitions. [2022-02-20 23:48:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:48:51,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:51,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:51,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:48:51,696 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:51,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1306109328, now seen corresponding path program 1 times [2022-02-20 23:48:51,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:51,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145698998] [2022-02-20 23:48:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:51,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:51,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {31588#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {31588#true} is VALID [2022-02-20 23:48:51,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-02-20 23:48:51,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31588#true} {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #285#return; {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:51,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {31588#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:51,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:51,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short21#1 := ~i~0 < 3; {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:51,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:51,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:51,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short23#1 := main_~y~0#1 < 5; {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:51,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:51,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:51,798 INFO L272 TraceCheckUtils]: 8: Hoare triple {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} call main_#t~ret24#1 := rand_end_point(); {31588#true} is VALID [2022-02-20 23:48:51,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {31588#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {31588#true} is VALID [2022-02-20 23:48:51,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-02-20 23:48:51,798 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {31588#true} {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #285#return; {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:51,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {31590#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {31594#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (= 3 |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:48:51,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {31594#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (= 3 |ULTIMATE.start_append_one_~list#1.base|))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {31595#(and (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)) (= 3 |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:48:51,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {31595#(and (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)) (= 3 |ULTIMATE.start_append_one_~list#1.base|))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} is VALID [2022-02-20 23:48:51,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} is VALID [2022-02-20 23:48:51,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} is VALID [2022-02-20 23:48:51,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} is VALID [2022-02-20 23:48:51,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} havoc create_item_#t~switch6#1; {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} is VALID [2022-02-20 23:48:51,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} is VALID [2022-02-20 23:48:51,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} is VALID [2022-02-20 23:48:51,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} is VALID [2022-02-20 23:48:51,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {31596#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {31597#(and (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} is VALID [2022-02-20 23:48:51,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {31597#(and (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {31597#(and (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} is VALID [2022-02-20 23:48:51,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {31597#(and (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {31597#(and (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} is VALID [2022-02-20 23:48:51,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {31597#(and (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {31597#(and (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} is VALID [2022-02-20 23:48:51,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {31597#(and (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) 4) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8) (< 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 1)))} assume !(4 + (append_one_~list#1.offset + 4 * append_one_~to#1) <= #length[append_one_~list#1.base] && 0 <= append_one_~list#1.offset + 4 * append_one_~to#1); {31589#false} is VALID [2022-02-20 23:48:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:51,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:51,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145698998] [2022-02-20 23:48:51,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145698998] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:51,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:51,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:48:51,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664177123] [2022-02-20 23:48:51,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:51,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-20 23:48:51,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:51,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:51,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:51,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:51,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:51,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:51,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:51,826 INFO L87 Difference]: Start difference. First operand 439 states and 595 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:52,825 INFO L93 Difference]: Finished difference Result 552 states and 696 transitions. [2022-02-20 23:48:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:52,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-20 23:48:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 362 transitions. [2022-02-20 23:48:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 362 transitions. [2022-02-20 23:48:52,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 362 transitions. [2022-02-20 23:48:53,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 362 edges. 362 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:53,143 INFO L225 Difference]: With dead ends: 552 [2022-02-20 23:48:53,143 INFO L226 Difference]: Without dead ends: 552 [2022-02-20 23:48:53,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:53,147 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 982 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:53,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [982 Valid, 375 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-02-20 23:48:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 455. [2022-02-20 23:48:53,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:53,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 552 states. Second operand has 455 states, 389 states have (on average 1.5295629820051413) internal successors, (595), 434 states have internal predecessors, (595), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:48:53,184 INFO L74 IsIncluded]: Start isIncluded. First operand 552 states. Second operand has 455 states, 389 states have (on average 1.5295629820051413) internal successors, (595), 434 states have internal predecessors, (595), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:48:53,185 INFO L87 Difference]: Start difference. First operand 552 states. Second operand has 455 states, 389 states have (on average 1.5295629820051413) internal successors, (595), 434 states have internal predecessors, (595), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:48:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:53,194 INFO L93 Difference]: Finished difference Result 552 states and 696 transitions. [2022-02-20 23:48:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 696 transitions. [2022-02-20 23:48:53,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:53,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:53,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 455 states, 389 states have (on average 1.5295629820051413) internal successors, (595), 434 states have internal predecessors, (595), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 552 states. [2022-02-20 23:48:53,196 INFO L87 Difference]: Start difference. First operand has 455 states, 389 states have (on average 1.5295629820051413) internal successors, (595), 434 states have internal predecessors, (595), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 552 states. [2022-02-20 23:48:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:53,220 INFO L93 Difference]: Finished difference Result 552 states and 696 transitions. [2022-02-20 23:48:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 696 transitions. [2022-02-20 23:48:53,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:53,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:53,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:53,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 389 states have (on average 1.5295629820051413) internal successors, (595), 434 states have internal predecessors, (595), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:48:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 623 transitions. [2022-02-20 23:48:53,243 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 623 transitions. Word has length 27 [2022-02-20 23:48:53,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:53,243 INFO L470 AbstractCegarLoop]: Abstraction has 455 states and 623 transitions. [2022-02-20 23:48:53,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 623 transitions. [2022-02-20 23:48:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:48:53,245 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:53,245 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:53,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 23:48:53,245 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:53,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1834683473, now seen corresponding path program 1 times [2022-02-20 23:48:53,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:53,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288934700] [2022-02-20 23:48:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:53,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:53,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {33719#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {33728#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:53,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {33728#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {33728#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:53,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33728#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {33719#true} #285#return; {33724#(and (<= |ULTIMATE.start_main_#t~ret24#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret24#1|))} is VALID [2022-02-20 23:48:53,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {33719#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {33719#true} is VALID [2022-02-20 23:48:53,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {33719#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {33719#true} is VALID [2022-02-20 23:48:53,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {33719#true} main_#t~short21#1 := ~i~0 < 3; {33719#true} is VALID [2022-02-20 23:48:53,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {33719#true} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {33719#true} is VALID [2022-02-20 23:48:53,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {33719#true} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {33719#true} is VALID [2022-02-20 23:48:53,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {33719#true} main_#t~short23#1 := main_~y~0#1 < 5; {33719#true} is VALID [2022-02-20 23:48:53,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {33719#true} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {33719#true} is VALID [2022-02-20 23:48:53,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {33719#true} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {33719#true} is VALID [2022-02-20 23:48:53,357 INFO L272 TraceCheckUtils]: 8: Hoare triple {33719#true} call main_#t~ret24#1 := rand_end_point(); {33719#true} is VALID [2022-02-20 23:48:53,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {33719#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {33728#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:53,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {33728#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {33728#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:53,358 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {33728#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {33719#true} #285#return; {33724#(and (<= |ULTIMATE.start_main_#t~ret24#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret24#1|))} is VALID [2022-02-20 23:48:53,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {33724#(and (<= |ULTIMATE.start_main_#t~ret24#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret24#1|))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {33725#(and (<= |ULTIMATE.start_append_one_~to#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {33725#(and (<= |ULTIMATE.start_append_one_~to#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} havoc create_item_#t~switch6#1; {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} is VALID [2022-02-20 23:48:53,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {33726#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {33727#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)))} is VALID [2022-02-20 23:48:53,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {33727#(and (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)))} assume !(4 + (append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[append_one_~list#1.base] && 0 <= append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {33720#false} is VALID [2022-02-20 23:48:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:53,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:53,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288934700] [2022-02-20 23:48:53,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288934700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:53,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:53,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:48:53,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038143675] [2022-02-20 23:48:53,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:53,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-02-20 23:48:53,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:53,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:53,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:53,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:53,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:53,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:53,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:53,383 INFO L87 Difference]: Start difference. First operand 455 states and 623 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:53,999 INFO L93 Difference]: Finished difference Result 480 states and 621 transitions. [2022-02-20 23:48:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:48:53,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-02-20 23:48:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 249 transitions. [2022-02-20 23:48:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 249 transitions. [2022-02-20 23:48:54,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 249 transitions. [2022-02-20 23:48:54,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:54,138 INFO L225 Difference]: With dead ends: 480 [2022-02-20 23:48:54,138 INFO L226 Difference]: Without dead ends: 480 [2022-02-20 23:48:54,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:54,139 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 420 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:54,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [420 Valid, 875 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-02-20 23:48:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 453. [2022-02-20 23:48:54,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:54,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 480 states. Second operand has 453 states, 389 states have (on average 1.519280205655527) internal successors, (591), 432 states have internal predecessors, (591), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:48:54,169 INFO L74 IsIncluded]: Start isIncluded. First operand 480 states. Second operand has 453 states, 389 states have (on average 1.519280205655527) internal successors, (591), 432 states have internal predecessors, (591), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:48:54,169 INFO L87 Difference]: Start difference. First operand 480 states. Second operand has 453 states, 389 states have (on average 1.519280205655527) internal successors, (591), 432 states have internal predecessors, (591), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:48:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:54,191 INFO L93 Difference]: Finished difference Result 480 states and 621 transitions. [2022-02-20 23:48:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 621 transitions. [2022-02-20 23:48:54,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:54,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:54,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 453 states, 389 states have (on average 1.519280205655527) internal successors, (591), 432 states have internal predecessors, (591), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 480 states. [2022-02-20 23:48:54,203 INFO L87 Difference]: Start difference. First operand has 453 states, 389 states have (on average 1.519280205655527) internal successors, (591), 432 states have internal predecessors, (591), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 480 states. [2022-02-20 23:48:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:54,220 INFO L93 Difference]: Finished difference Result 480 states and 621 transitions. [2022-02-20 23:48:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 621 transitions. [2022-02-20 23:48:54,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:54,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:54,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:54,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 389 states have (on average 1.519280205655527) internal successors, (591), 432 states have internal predecessors, (591), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:48:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 619 transitions. [2022-02-20 23:48:54,243 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 619 transitions. Word has length 28 [2022-02-20 23:48:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:54,243 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 619 transitions. [2022-02-20 23:48:54,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 619 transitions. [2022-02-20 23:48:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:48:54,244 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:54,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:54,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:48:54,244 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:54,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1486279512, now seen corresponding path program 1 times [2022-02-20 23:48:54,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:54,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352194739] [2022-02-20 23:48:54,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:54,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:54,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:54,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {35633#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {35633#true} is VALID [2022-02-20 23:48:54,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {35633#true} assume true; {35633#true} is VALID [2022-02-20 23:48:54,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35633#true} {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #287#return; {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {35633#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short21#1 := ~i~0 < 3; {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short23#1 := main_~y~0#1 < 5; {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short28#1 := main_~z~0#1 < 10; {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,356 INFO L272 TraceCheckUtils]: 11: Hoare triple {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} call main_#t~ret29#1 := rand_end_point(); {35633#true} is VALID [2022-02-20 23:48:54,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {35633#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {35633#true} is VALID [2022-02-20 23:48:54,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {35633#true} assume true; {35633#true} is VALID [2022-02-20 23:48:54,357 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {35633#true} {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #287#return; {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:54,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {35635#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:54,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:54,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:54,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:54,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:54,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10); {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:54,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_#res#1 := is_empty_~no_beg~0#1; {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:54,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} remove_one_#t~ret11#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret11#1 && remove_one_#t~ret11#1 <= 2147483647; {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:54,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume !(0 != remove_one_#t~ret11#1);havoc remove_one_#t~ret11#1; {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:54,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:54,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:54,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume remove_one_#t~mem12#1.base == remove_one_#t~mem13#1.base && remove_one_#t~mem12#1.offset == remove_one_#t~mem13#1.offset;havoc remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset;havoc remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset; {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:54,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {35639#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L707 {35640#(= |ULTIMATE.start_remove_one_#t~mem14#1.offset| 0)} is VALID [2022-02-20 23:48:54,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {35640#(= |ULTIMATE.start_remove_one_#t~mem14#1.offset| 0)} assume !(0 == remove_one_#t~mem14#1.offset); {35634#false} is VALID [2022-02-20 23:48:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:54,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:54,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352194739] [2022-02-20 23:48:54,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352194739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:54,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:54,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:54,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189389292] [2022-02-20 23:48:54,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:54,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-20 23:48:54,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:54,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:54,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:54,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:54,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:54,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:54,383 INFO L87 Difference]: Start difference. First operand 453 states and 619 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:54,733 INFO L93 Difference]: Finished difference Result 518 states and 681 transitions. [2022-02-20 23:48:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:54,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-20 23:48:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 278 transitions. [2022-02-20 23:48:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 278 transitions. [2022-02-20 23:48:54,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 278 transitions. [2022-02-20 23:48:54,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:54,873 INFO L225 Difference]: With dead ends: 518 [2022-02-20 23:48:54,874 INFO L226 Difference]: Without dead ends: 518 [2022-02-20 23:48:54,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:54,877 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 168 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:54,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 560 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-02-20 23:48:54,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 453. [2022-02-20 23:48:54,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:54,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 518 states. Second operand has 453 states, 389 states have (on average 1.5141388174807198) internal successors, (589), 432 states have internal predecessors, (589), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:48:54,922 INFO L74 IsIncluded]: Start isIncluded. First operand 518 states. Second operand has 453 states, 389 states have (on average 1.5141388174807198) internal successors, (589), 432 states have internal predecessors, (589), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:48:54,923 INFO L87 Difference]: Start difference. First operand 518 states. Second operand has 453 states, 389 states have (on average 1.5141388174807198) internal successors, (589), 432 states have internal predecessors, (589), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:48:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:54,947 INFO L93 Difference]: Finished difference Result 518 states and 681 transitions. [2022-02-20 23:48:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 681 transitions. [2022-02-20 23:48:54,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:54,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:54,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 453 states, 389 states have (on average 1.5141388174807198) internal successors, (589), 432 states have internal predecessors, (589), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 518 states. [2022-02-20 23:48:54,951 INFO L87 Difference]: Start difference. First operand has 453 states, 389 states have (on average 1.5141388174807198) internal successors, (589), 432 states have internal predecessors, (589), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 518 states. [2022-02-20 23:48:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:54,961 INFO L93 Difference]: Finished difference Result 518 states and 681 transitions. [2022-02-20 23:48:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 681 transitions. [2022-02-20 23:48:54,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:54,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:54,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:54,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 389 states have (on average 1.5141388174807198) internal successors, (589), 432 states have internal predecessors, (589), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:48:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 617 transitions. [2022-02-20 23:48:54,980 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 617 transitions. Word has length 29 [2022-02-20 23:48:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:54,980 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 617 transitions. [2022-02-20 23:48:54,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 617 transitions. [2022-02-20 23:48:54,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:48:54,981 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:54,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:54,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-20 23:48:54,982 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:54,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:54,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1169975593, now seen corresponding path program 1 times [2022-02-20 23:48:54,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:54,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739436932] [2022-02-20 23:48:54,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:54,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:55,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:55,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {37654#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {37654#true} is VALID [2022-02-20 23:48:55,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {37654#true} assume true; {37654#true} is VALID [2022-02-20 23:48:55,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37654#true} {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} #287#return; {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {37654#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} main_#t~short21#1 := ~i~0 < 3; {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} main_#t~short23#1 := main_~y~0#1 < 5; {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} main_#t~short28#1 := main_~z~0#1 < 10; {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,094 INFO L272 TraceCheckUtils]: 11: Hoare triple {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} call main_#t~ret29#1 := rand_end_point(); {37654#true} is VALID [2022-02-20 23:48:55,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {37654#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {37654#true} is VALID [2022-02-20 23:48:55,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {37654#true} assume true; {37654#true} is VALID [2022-02-20 23:48:55,095 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {37654#true} {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} #287#return; {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:55,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {37656#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:55,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:55,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:55,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:55,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:55,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10); {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:55,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_#res#1 := is_empty_~no_beg~0#1; {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:55,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} remove_one_#t~ret11#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret11#1 && remove_one_#t~ret11#1 <= 2147483647; {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:55,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume !(0 != remove_one_#t~ret11#1);havoc remove_one_#t~ret11#1; {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:55,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:55,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:55,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume remove_one_#t~mem12#1.base == remove_one_#t~mem13#1.base && remove_one_#t~mem12#1.offset == remove_one_#t~mem13#1.offset;havoc remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset;havoc remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset; {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:55,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {37660#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L707 {37661#(and (= |ULTIMATE.start_remove_one_#t~mem14#1.base| 0) (<= 1 |#StackHeapBarrier|))} is VALID [2022-02-20 23:48:55,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {37661#(and (= |ULTIMATE.start_remove_one_#t~mem14#1.base| 0) (<= 1 |#StackHeapBarrier|))} assume 0 == remove_one_#t~mem14#1.offset; {37661#(and (= |ULTIMATE.start_remove_one_#t~mem14#1.base| 0) (<= 1 |#StackHeapBarrier|))} is VALID [2022-02-20 23:48:55,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {37661#(and (= |ULTIMATE.start_remove_one_#t~mem14#1.base| 0) (<= 1 |#StackHeapBarrier|))} assume !(remove_one_#t~mem14#1.base < #StackHeapBarrier); {37655#false} is VALID [2022-02-20 23:48:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:55,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:55,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739436932] [2022-02-20 23:48:55,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739436932] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:55,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:55,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:55,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328713993] [2022-02-20 23:48:55,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:55,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-20 23:48:55,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:55,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:55,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:55,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:55,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:55,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:55,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:55,126 INFO L87 Difference]: Start difference. First operand 453 states and 617 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:55,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:55,702 INFO L93 Difference]: Finished difference Result 565 states and 746 transitions. [2022-02-20 23:48:55,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:48:55,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-20 23:48:55,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 278 transitions. [2022-02-20 23:48:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 278 transitions. [2022-02-20 23:48:55,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 278 transitions. [2022-02-20 23:48:55,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:55,941 INFO L225 Difference]: With dead ends: 565 [2022-02-20 23:48:55,942 INFO L226 Difference]: Without dead ends: 565 [2022-02-20 23:48:55,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:55,942 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 161 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:55,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 513 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:55,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-02-20 23:48:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 493. [2022-02-20 23:48:55,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:55,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 565 states. Second operand has 493 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 470 states have internal predecessors, (641), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:55,954 INFO L74 IsIncluded]: Start isIncluded. First operand 565 states. Second operand has 493 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 470 states have internal predecessors, (641), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:55,955 INFO L87 Difference]: Start difference. First operand 565 states. Second operand has 493 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 470 states have internal predecessors, (641), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:55,966 INFO L93 Difference]: Finished difference Result 565 states and 746 transitions. [2022-02-20 23:48:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 746 transitions. [2022-02-20 23:48:55,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:55,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:55,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 493 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 470 states have internal predecessors, (641), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 565 states. [2022-02-20 23:48:55,967 INFO L87 Difference]: Start difference. First operand has 493 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 470 states have internal predecessors, (641), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 565 states. [2022-02-20 23:48:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:55,979 INFO L93 Difference]: Finished difference Result 565 states and 746 transitions. [2022-02-20 23:48:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 746 transitions. [2022-02-20 23:48:55,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:55,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:55,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:55,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 470 states have internal predecessors, (641), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 673 transitions. [2022-02-20 23:48:55,990 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 673 transitions. Word has length 30 [2022-02-20 23:48:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:55,991 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 673 transitions. [2022-02-20 23:48:55,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 673 transitions. [2022-02-20 23:48:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:48:55,991 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:55,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:55,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-20 23:48:55,991 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:55,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2100742417, now seen corresponding path program 1 times [2022-02-20 23:48:55,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:55,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450648175] [2022-02-20 23:48:55,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:55,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:56,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:56,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {39856#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {39867#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:56,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {39867#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {39867#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:56,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39867#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} #285#return; {39862#(and (<= |ULTIMATE.start_main_#t~ret24#1| ~unnamed1~0~LIST_BEG) (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:56,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {39856#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:56,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:56,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} main_#t~short21#1 := ~i~0 < 3; {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:56,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:56,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:56,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} main_#t~short23#1 := main_~y~0#1 < 5; {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:56,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:56,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:56,149 INFO L272 TraceCheckUtils]: 8: Hoare triple {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} call main_#t~ret24#1 := rand_end_point(); {39856#true} is VALID [2022-02-20 23:48:56,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {39856#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {39867#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:56,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {39867#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {39867#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:56,150 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {39867#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {39858#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} #285#return; {39862#(and (<= |ULTIMATE.start_main_#t~ret24#1| ~unnamed1~0~LIST_BEG) (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:56,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {39862#(and (<= |ULTIMATE.start_main_#t~ret24#1| ~unnamed1~0~LIST_BEG) (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {39863#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| 3) 8) (<= |ULTIMATE.start_append_one_~to#1| ~unnamed1~0~LIST_BEG) (= 3 |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:48:56,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {39863#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| 3) 8) (<= |ULTIMATE.start_append_one_~to#1| ~unnamed1~0~LIST_BEG) (= 3 |ULTIMATE.start_append_one_~list#1.base|))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {39864#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| 3) 8) (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= 3 |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:48:56,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {39864#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| 3) 8) (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= 3 |ULTIMATE.start_append_one_~list#1.base|))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} havoc create_item_#t~switch6#1; {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {39865#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:48:56,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {39866#(and (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume !(4 + (append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END) <= #length[append_one_~list#1.base] && 0 <= append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END); {39857#false} is VALID [2022-02-20 23:48:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:56,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:56,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450648175] [2022-02-20 23:48:56,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450648175] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:56,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:56,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:48:56,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856675232] [2022-02-20 23:48:56,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:56,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-20 23:48:56,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:56,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:56,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:56,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:48:56,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:56,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:48:56,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:48:56,182 INFO L87 Difference]: Start difference. First operand 493 states and 673 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:57,582 INFO L93 Difference]: Finished difference Result 585 states and 737 transitions. [2022-02-20 23:48:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:48:57,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-20 23:48:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 353 transitions. [2022-02-20 23:48:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 353 transitions. [2022-02-20 23:48:57,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 353 transitions. [2022-02-20 23:48:57,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:57,884 INFO L225 Difference]: With dead ends: 585 [2022-02-20 23:48:57,884 INFO L226 Difference]: Without dead ends: 585 [2022-02-20 23:48:57,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:48:57,885 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 965 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:57,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [967 Valid, 666 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:48:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-02-20 23:48:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 491. [2022-02-20 23:48:57,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:57,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 585 states. Second operand has 491 states, 426 states have (on average 1.4953051643192488) internal successors, (637), 468 states have internal predecessors, (637), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:57,890 INFO L74 IsIncluded]: Start isIncluded. First operand 585 states. Second operand has 491 states, 426 states have (on average 1.4953051643192488) internal successors, (637), 468 states have internal predecessors, (637), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:57,891 INFO L87 Difference]: Start difference. First operand 585 states. Second operand has 491 states, 426 states have (on average 1.4953051643192488) internal successors, (637), 468 states have internal predecessors, (637), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:57,916 INFO L93 Difference]: Finished difference Result 585 states and 737 transitions. [2022-02-20 23:48:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 737 transitions. [2022-02-20 23:48:57,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:57,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:57,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 491 states, 426 states have (on average 1.4953051643192488) internal successors, (637), 468 states have internal predecessors, (637), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 585 states. [2022-02-20 23:48:57,917 INFO L87 Difference]: Start difference. First operand has 491 states, 426 states have (on average 1.4953051643192488) internal successors, (637), 468 states have internal predecessors, (637), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 585 states. [2022-02-20 23:48:57,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:57,928 INFO L93 Difference]: Finished difference Result 585 states and 737 transitions. [2022-02-20 23:48:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 737 transitions. [2022-02-20 23:48:57,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:57,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:57,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:57,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 426 states have (on average 1.4953051643192488) internal successors, (637), 468 states have internal predecessors, (637), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 669 transitions. [2022-02-20 23:48:57,937 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 669 transitions. Word has length 30 [2022-02-20 23:48:57,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:57,937 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 669 transitions. [2022-02-20 23:48:57,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:57,937 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 669 transitions. [2022-02-20 23:48:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:48:57,937 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:57,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:57,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-20 23:48:57,937 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:57,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:57,938 INFO L85 PathProgramCache]: Analyzing trace with hash -252550768, now seen corresponding path program 1 times [2022-02-20 23:48:57,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:57,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417717424] [2022-02-20 23:48:57,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:57,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:57,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:57,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {42130#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {42137#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:57,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {42137#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {42137#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:57,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42137#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {42130#true} #287#return; {42135#(<= |ULTIMATE.start_main_#t~ret29#1| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:57,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {42130#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {42130#true} is VALID [2022-02-20 23:48:57,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {42130#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {42130#true} is VALID [2022-02-20 23:48:57,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {42130#true} main_#t~short21#1 := ~i~0 < 3; {42130#true} is VALID [2022-02-20 23:48:57,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {42130#true} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {42130#true} is VALID [2022-02-20 23:48:57,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {42130#true} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {42130#true} is VALID [2022-02-20 23:48:57,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {42130#true} main_#t~short23#1 := main_~y~0#1 < 5; {42130#true} is VALID [2022-02-20 23:48:57,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {42130#true} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {42130#true} is VALID [2022-02-20 23:48:57,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {42130#true} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {42130#true} is VALID [2022-02-20 23:48:57,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {42130#true} main_#t~short28#1 := main_~z~0#1 < 10; {42130#true} is VALID [2022-02-20 23:48:57,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {42130#true} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {42130#true} is VALID [2022-02-20 23:48:57,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {42130#true} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {42130#true} is VALID [2022-02-20 23:48:57,984 INFO L272 TraceCheckUtils]: 11: Hoare triple {42130#true} call main_#t~ret29#1 := rand_end_point(); {42130#true} is VALID [2022-02-20 23:48:57,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {42130#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {42137#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:57,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {42137#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {42137#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:57,985 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {42137#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {42130#true} #287#return; {42135#(<= |ULTIMATE.start_main_#t~ret29#1| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:57,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {42135#(<= |ULTIMATE.start_main_#t~ret29#1| ~unnamed1~0~LIST_BEG)} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10); {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is_empty_#res#1 := is_empty_~no_beg~0#1; {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} remove_one_#t~ret11#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret11#1 && remove_one_#t~ret11#1 <= 2147483647; {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume !(0 != remove_one_#t~ret11#1);havoc remove_one_#t~ret11#1; {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume !(remove_one_#t~mem12#1.base == remove_one_#t~mem13#1.base && remove_one_#t~mem12#1.offset == remove_one_#t~mem13#1.offset);havoc remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset;havoc remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset; {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume ~unnamed1~0~LIST_BEG == remove_one_~from#1;remove_one_#t~ite16#1 := ~unnamed2~0~ITEM_NEXT; {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} remove_one_~next_field~0#1 := remove_one_#t~ite16#1;havoc remove_one_#t~ite16#1; {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:57,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {42136#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume ~unnamed1~0~LIST_END == remove_one_~from#1;remove_one_#t~ite17#1 := ~unnamed2~0~ITEM_NEXT; {42131#false} is VALID [2022-02-20 23:48:57,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {42131#false} remove_one_~term_field~1#1 := remove_one_#t~ite17#1;havoc remove_one_#t~ite17#1; {42131#false} is VALID [2022-02-20 23:48:57,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {42131#false} assume !(4 + (remove_one_~list#1.offset + 4 * remove_one_~from#1) <= #length[remove_one_~list#1.base] && 0 <= remove_one_~list#1.offset + 4 * remove_one_~from#1); {42131#false} is VALID [2022-02-20 23:48:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:57,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:57,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417717424] [2022-02-20 23:48:57,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417717424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:57,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:57,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:57,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850862767] [2022-02-20 23:48:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:57,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 23:48:57,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:57,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:58,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:58,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:58,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:58,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:58,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:58,008 INFO L87 Difference]: Start difference. First operand 491 states and 669 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:58,314 INFO L93 Difference]: Finished difference Result 581 states and 776 transitions. [2022-02-20 23:48:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:58,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 23:48:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2022-02-20 23:48:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2022-02-20 23:48:58,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 219 transitions. [2022-02-20 23:48:58,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:58,524 INFO L225 Difference]: With dead ends: 581 [2022-02-20 23:48:58,524 INFO L226 Difference]: Without dead ends: 581 [2022-02-20 23:48:58,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:58,524 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 196 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:58,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 634 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-02-20 23:48:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 491. [2022-02-20 23:48:58,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:58,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 581 states. Second operand has 491 states, 426 states have (on average 1.4859154929577465) internal successors, (633), 468 states have internal predecessors, (633), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:58,531 INFO L74 IsIncluded]: Start isIncluded. First operand 581 states. Second operand has 491 states, 426 states have (on average 1.4859154929577465) internal successors, (633), 468 states have internal predecessors, (633), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:58,531 INFO L87 Difference]: Start difference. First operand 581 states. Second operand has 491 states, 426 states have (on average 1.4859154929577465) internal successors, (633), 468 states have internal predecessors, (633), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:58,542 INFO L93 Difference]: Finished difference Result 581 states and 776 transitions. [2022-02-20 23:48:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 776 transitions. [2022-02-20 23:48:58,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:58,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:58,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 491 states, 426 states have (on average 1.4859154929577465) internal successors, (633), 468 states have internal predecessors, (633), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 581 states. [2022-02-20 23:48:58,544 INFO L87 Difference]: Start difference. First operand has 491 states, 426 states have (on average 1.4859154929577465) internal successors, (633), 468 states have internal predecessors, (633), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 581 states. [2022-02-20 23:48:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:58,555 INFO L93 Difference]: Finished difference Result 581 states and 776 transitions. [2022-02-20 23:48:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 776 transitions. [2022-02-20 23:48:58,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:58,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:58,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:58,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 426 states have (on average 1.4859154929577465) internal successors, (633), 468 states have internal predecessors, (633), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 665 transitions. [2022-02-20 23:48:58,565 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 665 transitions. Word has length 32 [2022-02-20 23:48:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:58,565 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 665 transitions. [2022-02-20 23:48:58,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 665 transitions. [2022-02-20 23:48:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:48:58,565 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:58,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:58,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-20 23:48:58,566 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:58,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:58,566 INFO L85 PathProgramCache]: Analyzing trace with hash -252548846, now seen corresponding path program 1 times [2022-02-20 23:48:58,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:58,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608431232] [2022-02-20 23:48:58,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:58,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:58,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:58,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {44376#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {44385#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:58,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {44385#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {44385#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:58,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44385#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {44376#true} #287#return; {44381#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret29#1|) (<= |ULTIMATE.start_main_#t~ret29#1| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:58,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {44376#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {44376#true} is VALID [2022-02-20 23:48:58,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {44376#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {44376#true} is VALID [2022-02-20 23:48:58,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {44376#true} main_#t~short21#1 := ~i~0 < 3; {44376#true} is VALID [2022-02-20 23:48:58,657 INFO L290 TraceCheckUtils]: 3: Hoare triple {44376#true} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {44376#true} is VALID [2022-02-20 23:48:58,657 INFO L290 TraceCheckUtils]: 4: Hoare triple {44376#true} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {44376#true} is VALID [2022-02-20 23:48:58,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {44376#true} main_#t~short23#1 := main_~y~0#1 < 5; {44376#true} is VALID [2022-02-20 23:48:58,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {44376#true} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {44376#true} is VALID [2022-02-20 23:48:58,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {44376#true} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {44376#true} is VALID [2022-02-20 23:48:58,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {44376#true} main_#t~short28#1 := main_~z~0#1 < 10; {44376#true} is VALID [2022-02-20 23:48:58,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {44376#true} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {44376#true} is VALID [2022-02-20 23:48:58,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {44376#true} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {44376#true} is VALID [2022-02-20 23:48:58,657 INFO L272 TraceCheckUtils]: 11: Hoare triple {44376#true} call main_#t~ret29#1 := rand_end_point(); {44376#true} is VALID [2022-02-20 23:48:58,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {44376#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {44385#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:58,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {44385#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {44385#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:58,658 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {44385#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {44376#true} #287#return; {44381#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret29#1|) (<= |ULTIMATE.start_main_#t~ret29#1| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:58,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {44381#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret29#1|) (<= |ULTIMATE.start_main_#t~ret29#1| ~unnamed1~0~LIST_BEG))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10); {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is_empty_#res#1 := is_empty_~no_beg~0#1; {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} remove_one_#t~ret11#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret11#1 && remove_one_#t~ret11#1 <= 2147483647; {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} assume !(0 != remove_one_#t~ret11#1);havoc remove_one_#t~ret11#1; {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {44382#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {44383#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:58,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {44383#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG))} SUMMARY for call remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {44384#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:58,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {44384#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} assume !(remove_one_#t~mem12#1.base == remove_one_#t~mem13#1.base && remove_one_#t~mem12#1.offset == remove_one_#t~mem13#1.offset);havoc remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset;havoc remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset; {44384#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:58,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {44384#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} assume ~unnamed1~0~LIST_BEG == remove_one_~from#1;remove_one_#t~ite16#1 := ~unnamed2~0~ITEM_NEXT; {44384#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:58,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {44384#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} remove_one_~next_field~0#1 := remove_one_#t~ite16#1;havoc remove_one_#t~ite16#1; {44384#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:58,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {44384#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} assume !(~unnamed1~0~LIST_END == remove_one_~from#1);remove_one_#t~ite17#1 := ~unnamed2~0~ITEM_PREV; {44384#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:58,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {44384#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} remove_one_~term_field~1#1 := remove_one_#t~ite17#1;havoc remove_one_#t~ite17#1; {44384#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:58,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {44384#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} assume !(4 + (remove_one_~list#1.offset + 4 * remove_one_~from#1) <= #length[remove_one_~list#1.base] && 0 <= remove_one_~list#1.offset + 4 * remove_one_~from#1); {44377#false} is VALID [2022-02-20 23:48:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:58,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:58,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608431232] [2022-02-20 23:48:58,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608431232] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:58,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:58,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:48:58,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451388296] [2022-02-20 23:48:58,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 23:48:58,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:58,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:58,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:58,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:58,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:58,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:58,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:58,685 INFO L87 Difference]: Start difference. First operand 491 states and 665 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:59,596 INFO L93 Difference]: Finished difference Result 750 states and 983 transitions. [2022-02-20 23:48:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:48:59,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 23:48:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 338 transitions. [2022-02-20 23:48:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 338 transitions. [2022-02-20 23:48:59,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 338 transitions. [2022-02-20 23:48:59,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 338 edges. 338 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:59,837 INFO L225 Difference]: With dead ends: 750 [2022-02-20 23:48:59,837 INFO L226 Difference]: Without dead ends: 750 [2022-02-20 23:48:59,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:48:59,838 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 464 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:59,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 1008 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-02-20 23:48:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 488. [2022-02-20 23:48:59,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:59,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 750 states. Second operand has 488 states, 426 states have (on average 1.4530516431924883) internal successors, (619), 465 states have internal predecessors, (619), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:59,847 INFO L74 IsIncluded]: Start isIncluded. First operand 750 states. Second operand has 488 states, 426 states have (on average 1.4530516431924883) internal successors, (619), 465 states have internal predecessors, (619), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:59,847 INFO L87 Difference]: Start difference. First operand 750 states. Second operand has 488 states, 426 states have (on average 1.4530516431924883) internal successors, (619), 465 states have internal predecessors, (619), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:59,863 INFO L93 Difference]: Finished difference Result 750 states and 983 transitions. [2022-02-20 23:48:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 983 transitions. [2022-02-20 23:48:59,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:59,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:59,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 488 states, 426 states have (on average 1.4530516431924883) internal successors, (619), 465 states have internal predecessors, (619), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 750 states. [2022-02-20 23:48:59,866 INFO L87 Difference]: Start difference. First operand has 488 states, 426 states have (on average 1.4530516431924883) internal successors, (619), 465 states have internal predecessors, (619), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 750 states. [2022-02-20 23:48:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:59,882 INFO L93 Difference]: Finished difference Result 750 states and 983 transitions. [2022-02-20 23:48:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 983 transitions. [2022-02-20 23:48:59,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:59,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:59,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:59,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 426 states have (on average 1.4530516431924883) internal successors, (619), 465 states have internal predecessors, (619), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 23:48:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 651 transitions. [2022-02-20 23:48:59,891 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 651 transitions. Word has length 32 [2022-02-20 23:48:59,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:59,891 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 651 transitions. [2022-02-20 23:48:59,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 651 transitions. [2022-02-20 23:48:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:48:59,892 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:59,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:59,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-20 23:48:59,892 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:48:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash -934879925, now seen corresponding path program 1 times [2022-02-20 23:48:59,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:59,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115675016] [2022-02-20 23:48:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:00,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:49:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:00,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {47138#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {47138#true} is VALID [2022-02-20 23:49:00,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {47138#true} assume true; {47138#true} is VALID [2022-02-20 23:49:00,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47138#true} {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #287#return; {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {47138#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short21#1 := ~i~0 < 3; {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,018 INFO L290 TraceCheckUtils]: 3: Hoare triple {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short23#1 := main_~y~0#1 < 5; {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short28#1 := main_~z~0#1 < 10; {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,021 INFO L272 TraceCheckUtils]: 11: Hoare triple {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret29#1 := rand_end_point(); {47138#true} is VALID [2022-02-20 23:49:00,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {47138#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {47138#true} is VALID [2022-02-20 23:49:00,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {47138#true} assume true; {47138#true} is VALID [2022-02-20 23:49:00,022 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {47138#true} {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #287#return; {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {47140#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:49:00,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:49:00,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:49:00,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:49:00,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:49:00,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10); {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:49:00,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_#res#1 := is_empty_~no_beg~0#1; {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:49:00,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} remove_one_#t~ret11#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret11#1 && remove_one_#t~ret11#1 <= 2147483647; {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:49:00,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume !(0 != remove_one_#t~ret11#1);havoc remove_one_#t~ret11#1; {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:49:00,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:49:00,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:49:00,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume remove_one_#t~mem12#1.base == remove_one_#t~mem13#1.base && remove_one_#t~mem12#1.offset == remove_one_#t~mem13#1.offset;havoc remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset;havoc remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset; {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:49:00,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {47144#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L707 {47145#(and (not (= |ULTIMATE.start_remove_one_#t~mem14#1.base| 3)) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {47145#(and (not (= |ULTIMATE.start_remove_one_#t~mem14#1.base| 3)) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1))} assume 0 == remove_one_#t~mem14#1.offset; {47145#(and (not (= |ULTIMATE.start_remove_one_#t~mem14#1.base| 3)) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {47145#(and (not (= |ULTIMATE.start_remove_one_#t~mem14#1.base| 3)) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1))} assume remove_one_#t~mem14#1.base < #StackHeapBarrier; {47145#(and (not (= |ULTIMATE.start_remove_one_#t~mem14#1.base| 3)) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:00,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {47145#(and (not (= |ULTIMATE.start_remove_one_#t~mem14#1.base| 3)) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1))} assume 0 == remove_one_#t~mem14#1.base || 1 == #valid[remove_one_#t~mem14#1.base];call ULTIMATE.dealloc(remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset);havoc remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {47146#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:49:00,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {47146#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {47139#false} is VALID [2022-02-20 23:49:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:00,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:00,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115675016] [2022-02-20 23:49:00,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115675016] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:00,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:00,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:49:00,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946649589] [2022-02-20 23:49:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:00,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 23:49:00,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:00,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:00,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:00,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:49:00,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:00,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:49:00,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:00,067 INFO L87 Difference]: Start difference. First operand 488 states and 651 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:01,307 INFO L93 Difference]: Finished difference Result 925 states and 1213 transitions. [2022-02-20 23:49:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:49:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 23:49:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 463 transitions. [2022-02-20 23:49:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 463 transitions. [2022-02-20 23:49:01,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 463 transitions. [2022-02-20 23:49:01,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:01,559 INFO L225 Difference]: With dead ends: 925 [2022-02-20 23:49:01,559 INFO L226 Difference]: Without dead ends: 925 [2022-02-20 23:49:01,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:49:01,559 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 351 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:01,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 834 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:49:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-02-20 23:49:01,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 557. [2022-02-20 23:49:01,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:01,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 925 states. Second operand has 557 states, 489 states have (on average 1.4355828220858895) internal successors, (702), 530 states have internal predecessors, (702), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:49:01,567 INFO L74 IsIncluded]: Start isIncluded. First operand 925 states. Second operand has 557 states, 489 states have (on average 1.4355828220858895) internal successors, (702), 530 states have internal predecessors, (702), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:49:01,567 INFO L87 Difference]: Start difference. First operand 925 states. Second operand has 557 states, 489 states have (on average 1.4355828220858895) internal successors, (702), 530 states have internal predecessors, (702), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:49:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:01,590 INFO L93 Difference]: Finished difference Result 925 states and 1213 transitions. [2022-02-20 23:49:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1213 transitions. [2022-02-20 23:49:01,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:01,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:01,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 557 states, 489 states have (on average 1.4355828220858895) internal successors, (702), 530 states have internal predecessors, (702), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) Second operand 925 states. [2022-02-20 23:49:01,593 INFO L87 Difference]: Start difference. First operand has 557 states, 489 states have (on average 1.4355828220858895) internal successors, (702), 530 states have internal predecessors, (702), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) Second operand 925 states. [2022-02-20 23:49:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:01,617 INFO L93 Difference]: Finished difference Result 925 states and 1213 transitions. [2022-02-20 23:49:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1213 transitions. [2022-02-20 23:49:01,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:01,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:01,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:01,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 489 states have (on average 1.4355828220858895) internal successors, (702), 530 states have internal predecessors, (702), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:49:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 742 transitions. [2022-02-20 23:49:01,628 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 742 transitions. Word has length 32 [2022-02-20 23:49:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:01,628 INFO L470 AbstractCegarLoop]: Abstraction has 557 states and 742 transitions. [2022-02-20 23:49:01,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 742 transitions. [2022-02-20 23:49:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:49:01,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:01,629 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:01,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-20 23:49:01,629 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:01,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:01,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1427861429, now seen corresponding path program 1 times [2022-02-20 23:49:01,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:01,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920210613] [2022-02-20 23:49:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:01,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:01,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 23:49:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:01,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {50489#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {50489#true} is VALID [2022-02-20 23:49:01,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {50489#true} assume true; {50489#true} is VALID [2022-02-20 23:49:01,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50489#true} {50490#false} #287#return; {50490#false} is VALID [2022-02-20 23:49:01,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {50489#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {50491#(= ~i~0 0)} is VALID [2022-02-20 23:49:01,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {50491#(= ~i~0 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {50491#(= ~i~0 0)} is VALID [2022-02-20 23:49:01,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {50491#(= ~i~0 0)} main_#t~short21#1 := ~i~0 < 3; {50491#(= ~i~0 0)} is VALID [2022-02-20 23:49:01,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {50491#(= ~i~0 0)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {50491#(= ~i~0 0)} is VALID [2022-02-20 23:49:01,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {50491#(= ~i~0 0)} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {50491#(= ~i~0 0)} is VALID [2022-02-20 23:49:01,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {50491#(= ~i~0 0)} main_#t~short23#1 := main_~y~0#1 < 5; {50491#(= ~i~0 0)} is VALID [2022-02-20 23:49:01,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {50491#(= ~i~0 0)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {50491#(= ~i~0 0)} is VALID [2022-02-20 23:49:01,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {50491#(= ~i~0 0)} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {50491#(= ~i~0 0)} is VALID [2022-02-20 23:49:01,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {50491#(= ~i~0 0)} main_#t~short28#1 := main_~z~0#1 < 10; {50491#(= ~i~0 0)} is VALID [2022-02-20 23:49:01,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {50491#(= ~i~0 0)} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {50491#(= ~i~0 0)} is VALID [2022-02-20 23:49:01,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {50491#(= ~i~0 0)} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {50491#(= ~i~0 0)} is VALID [2022-02-20 23:49:01,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {50491#(= ~i~0 0)} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {50492#(<= ~i~0 1)} is VALID [2022-02-20 23:49:01,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {50492#(<= ~i~0 1)} main_#t~short21#1 := ~i~0 < 3; {50493#|ULTIMATE.start_main_#t~short21#1|} is VALID [2022-02-20 23:49:01,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {50493#|ULTIMATE.start_main_#t~short21#1|} assume !main_#t~short21#1; {50490#false} is VALID [2022-02-20 23:49:01,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {50490#false} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {50490#false} is VALID [2022-02-20 23:49:01,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {50490#false} main_#t~short23#1 := main_~y~0#1 < 5; {50490#false} is VALID [2022-02-20 23:49:01,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {50490#false} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {50490#false} is VALID [2022-02-20 23:49:01,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {50490#false} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {50490#false} is VALID [2022-02-20 23:49:01,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {50490#false} main_#t~short28#1 := main_~z~0#1 < 10; {50490#false} is VALID [2022-02-20 23:49:01,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {50490#false} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {50490#false} is VALID [2022-02-20 23:49:01,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {50490#false} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {50490#false} is VALID [2022-02-20 23:49:01,664 INFO L272 TraceCheckUtils]: 21: Hoare triple {50490#false} call main_#t~ret29#1 := rand_end_point(); {50489#true} is VALID [2022-02-20 23:49:01,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {50489#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {50489#true} is VALID [2022-02-20 23:49:01,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {50489#true} assume true; {50489#true} is VALID [2022-02-20 23:49:01,667 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {50489#true} {50490#false} #287#return; {50490#false} is VALID [2022-02-20 23:49:01,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {50490#false} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {50490#false} is VALID [2022-02-20 23:49:01,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {50490#false} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {50490#false} is VALID [2022-02-20 23:49:01,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {50490#false} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {50490#false} is VALID [2022-02-20 23:49:01,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {50490#false} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {50490#false} is VALID [2022-02-20 23:49:01,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {50490#false} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {50490#false} is VALID [2022-02-20 23:49:01,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {50490#false} assume is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10; {50490#false} is VALID [2022-02-20 23:49:01,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {50490#false} assume 0 == is_empty_~list#1.offset; {50490#false} is VALID [2022-02-20 23:49:01,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {50490#false} assume !(is_empty_~list#1.base < #StackHeapBarrier); {50490#false} is VALID [2022-02-20 23:49:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:01,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:01,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920210613] [2022-02-20 23:49:01,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920210613] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:01,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601293995] [2022-02-20 23:49:01,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:01,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:01,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:01,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:01,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:49:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:01,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:49:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:01,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:01,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {50489#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {50489#true} is VALID [2022-02-20 23:49:01,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {50489#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {50489#true} is VALID [2022-02-20 23:49:01,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {50489#true} main_#t~short21#1 := ~i~0 < 3; {50489#true} is VALID [2022-02-20 23:49:01,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {50489#true} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {50489#true} is VALID [2022-02-20 23:49:01,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {50489#true} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {50489#true} is VALID [2022-02-20 23:49:01,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {50489#true} main_#t~short23#1 := main_~y~0#1 < 5; {50489#true} is VALID [2022-02-20 23:49:01,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {50489#true} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {50489#true} is VALID [2022-02-20 23:49:01,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {50489#true} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {50489#true} is VALID [2022-02-20 23:49:01,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {50489#true} main_#t~short28#1 := main_~z~0#1 < 10; {50489#true} is VALID [2022-02-20 23:49:01,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {50489#true} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {50489#true} is VALID [2022-02-20 23:49:01,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {50489#true} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {50489#true} is VALID [2022-02-20 23:49:01,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {50489#true} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {50489#true} is VALID [2022-02-20 23:49:01,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {50489#true} main_#t~short21#1 := ~i~0 < 3; {50489#true} is VALID [2022-02-20 23:49:01,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {50489#true} assume !main_#t~short21#1; {50539#(not |ULTIMATE.start_main_#t~short21#1|)} is VALID [2022-02-20 23:49:01,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {50539#(not |ULTIMATE.start_main_#t~short21#1|)} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {50490#false} is VALID [2022-02-20 23:49:01,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {50490#false} main_#t~short23#1 := main_~y~0#1 < 5; {50490#false} is VALID [2022-02-20 23:49:01,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {50490#false} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {50490#false} is VALID [2022-02-20 23:49:01,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {50490#false} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {50490#false} is VALID [2022-02-20 23:49:01,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {50490#false} main_#t~short28#1 := main_~z~0#1 < 10; {50490#false} is VALID [2022-02-20 23:49:01,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {50490#false} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {50490#false} is VALID [2022-02-20 23:49:01,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {50490#false} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {50490#false} is VALID [2022-02-20 23:49:01,835 INFO L272 TraceCheckUtils]: 21: Hoare triple {50490#false} call main_#t~ret29#1 := rand_end_point(); {50490#false} is VALID [2022-02-20 23:49:01,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {50490#false} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {50490#false} is VALID [2022-02-20 23:49:01,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {50490#false} assume true; {50490#false} is VALID [2022-02-20 23:49:01,835 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {50490#false} {50490#false} #287#return; {50490#false} is VALID [2022-02-20 23:49:01,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {50490#false} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {50490#false} is VALID [2022-02-20 23:49:01,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {50490#false} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {50490#false} is VALID [2022-02-20 23:49:01,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {50490#false} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {50490#false} is VALID [2022-02-20 23:49:01,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {50490#false} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {50490#false} is VALID [2022-02-20 23:49:01,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {50490#false} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {50490#false} is VALID [2022-02-20 23:49:01,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {50490#false} assume is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10; {50490#false} is VALID [2022-02-20 23:49:01,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {50490#false} assume 0 == is_empty_~list#1.offset; {50490#false} is VALID [2022-02-20 23:49:01,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {50490#false} assume !(is_empty_~list#1.base < #StackHeapBarrier); {50490#false} is VALID [2022-02-20 23:49:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:49:01,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:01,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601293995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:01,837 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:49:01,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-02-20 23:49:01,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633515411] [2022-02-20 23:49:01,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:01,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-20 23:49:01,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:01,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:01,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:01,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:49:01,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:49:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:01,868 INFO L87 Difference]: Start difference. First operand 557 states and 742 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:02,026 INFO L93 Difference]: Finished difference Result 566 states and 750 transitions. [2022-02-20 23:49:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:49:02,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-20 23:49:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-02-20 23:49:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-02-20 23:49:02,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2022-02-20 23:49:02,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:02,132 INFO L225 Difference]: With dead ends: 566 [2022-02-20 23:49:02,132 INFO L226 Difference]: Without dead ends: 565 [2022-02-20 23:49:02,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:02,132 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:02,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-02-20 23:49:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 561. [2022-02-20 23:49:02,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:02,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 565 states. Second operand has 561 states, 493 states have (on average 1.4300202839756593) internal successors, (705), 534 states have internal predecessors, (705), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:49:02,140 INFO L74 IsIncluded]: Start isIncluded. First operand 565 states. Second operand has 561 states, 493 states have (on average 1.4300202839756593) internal successors, (705), 534 states have internal predecessors, (705), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:49:02,141 INFO L87 Difference]: Start difference. First operand 565 states. Second operand has 561 states, 493 states have (on average 1.4300202839756593) internal successors, (705), 534 states have internal predecessors, (705), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:49:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:02,151 INFO L93 Difference]: Finished difference Result 565 states and 749 transitions. [2022-02-20 23:49:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 749 transitions. [2022-02-20 23:49:02,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:02,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:02,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 561 states, 493 states have (on average 1.4300202839756593) internal successors, (705), 534 states have internal predecessors, (705), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) Second operand 565 states. [2022-02-20 23:49:02,152 INFO L87 Difference]: Start difference. First operand has 561 states, 493 states have (on average 1.4300202839756593) internal successors, (705), 534 states have internal predecessors, (705), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) Second operand 565 states. [2022-02-20 23:49:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:02,162 INFO L93 Difference]: Finished difference Result 565 states and 749 transitions. [2022-02-20 23:49:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 749 transitions. [2022-02-20 23:49:02,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:02,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:02,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:02,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 493 states have (on average 1.4300202839756593) internal successors, (705), 534 states have internal predecessors, (705), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:49:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 745 transitions. [2022-02-20 23:49:02,173 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 745 transitions. Word has length 33 [2022-02-20 23:49:02,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:02,173 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 745 transitions. [2022-02-20 23:49:02,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 745 transitions. [2022-02-20 23:49:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:49:02,174 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:02,174 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:02,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:02,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:02,391 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:02,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2049457417, now seen corresponding path program 1 times [2022-02-20 23:49:02,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:02,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459467638] [2022-02-20 23:49:02,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:02,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:02,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 23:49:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:02,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {52853#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {52853#true} is VALID [2022-02-20 23:49:02,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {52853#true} assume true; {52853#true} is VALID [2022-02-20 23:49:02,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52853#true} {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #287#return; {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {52853#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short21#1 := ~i~0 < 3; {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short23#1 := main_~y~0#1 < 5; {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short28#1 := main_~z~0#1 < 10; {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {52855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short21#1 := ~i~0 < 3; {52856#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (or (<= ~i~0 2) (not |ULTIMATE.start_main_#t~short21#1|)) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {52856#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (or (<= ~i~0 2) (not |ULTIMATE.start_main_#t~short21#1|)) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short23#1 := main_~y~0#1 < 5; {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short28#1 := main_~z~0#1 < 10; {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,768 INFO L272 TraceCheckUtils]: 21: Hoare triple {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} call main_#t~ret29#1 := rand_end_point(); {52853#true} is VALID [2022-02-20 23:49:02,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {52853#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {52853#true} is VALID [2022-02-20 23:49:02,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {52853#true} assume true; {52853#true} is VALID [2022-02-20 23:49:02,769 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {52853#true} {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #287#return; {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:02,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {52857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= ~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {52861#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (<= ~i~0 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0)) (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is VALID [2022-02-20 23:49:02,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {52861#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (<= ~i~0 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0)) (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {52862#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (<= ~i~0 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_#t~mem3#1.base| 0) (= 0 |ULTIMATE.start_is_empty_#t~mem3#1.offset|)) (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is VALID [2022-02-20 23:49:02,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {52862#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (<= ~i~0 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_#t~mem3#1.base| 0) (= 0 |ULTIMATE.start_is_empty_#t~mem3#1.offset|)) (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {52863#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (<= ~i~0 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is VALID [2022-02-20 23:49:02,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {52863#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (<= ~i~0 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {52864#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (and (<= ~i~0 2) (= |ULTIMATE.start_is_empty_#t~mem4#1.base| 0) (= |ULTIMATE.start_is_empty_#t~mem4#1.offset| 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is VALID [2022-02-20 23:49:02,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {52864#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (and (<= ~i~0 2) (= |ULTIMATE.start_is_empty_#t~mem4#1.base| 0) (= |ULTIMATE.start_is_empty_#t~mem4#1.offset| 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {52865#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (and (= |ULTIMATE.start_is_empty_~no_end~0#1| |ULTIMATE.start_is_empty_~no_beg~0#1|) (<= ~i~0 2)) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is VALID [2022-02-20 23:49:02,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {52865#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (and (= |ULTIMATE.start_is_empty_~no_end~0#1| |ULTIMATE.start_is_empty_~no_beg~0#1|) (<= ~i~0 2)) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} assume is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10; {52866#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} is VALID [2022-02-20 23:49:02,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {52866#(or (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|) 3) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)))} assume 0 == is_empty_~list#1.offset; {52854#false} is VALID [2022-02-20 23:49:02,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {52854#false} assume !(is_empty_~list#1.base < #StackHeapBarrier); {52854#false} is VALID [2022-02-20 23:49:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:49:02,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:02,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459467638] [2022-02-20 23:49:02,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459467638] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:02,775 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:02,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:49:02,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338641108] [2022-02-20 23:49:02,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:02,775 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-20 23:49:02,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:02,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:02,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:02,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:49:02,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:02,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:49:02,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:49:02,814 INFO L87 Difference]: Start difference. First operand 561 states and 745 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:04,231 INFO L93 Difference]: Finished difference Result 596 states and 770 transitions. [2022-02-20 23:49:04,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:49:04,231 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-20 23:49:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 266 transitions. [2022-02-20 23:49:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 266 transitions. [2022-02-20 23:49:04,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 266 transitions. [2022-02-20 23:49:04,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:04,527 INFO L225 Difference]: With dead ends: 596 [2022-02-20 23:49:04,527 INFO L226 Difference]: Without dead ends: 594 [2022-02-20 23:49:04,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:49:04,528 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 279 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:04,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 1017 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:49:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-02-20 23:49:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 518. [2022-02-20 23:49:04,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:04,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 594 states. Second operand has 518 states, 453 states have (on average 1.4216335540838851) internal successors, (644), 493 states have internal predecessors, (644), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:04,534 INFO L74 IsIncluded]: Start isIncluded. First operand 594 states. Second operand has 518 states, 453 states have (on average 1.4216335540838851) internal successors, (644), 493 states have internal predecessors, (644), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:04,535 INFO L87 Difference]: Start difference. First operand 594 states. Second operand has 518 states, 453 states have (on average 1.4216335540838851) internal successors, (644), 493 states have internal predecessors, (644), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:04,545 INFO L93 Difference]: Finished difference Result 594 states and 768 transitions. [2022-02-20 23:49:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 768 transitions. [2022-02-20 23:49:04,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:04,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:04,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 518 states, 453 states have (on average 1.4216335540838851) internal successors, (644), 493 states have internal predecessors, (644), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 594 states. [2022-02-20 23:49:04,547 INFO L87 Difference]: Start difference. First operand has 518 states, 453 states have (on average 1.4216335540838851) internal successors, (644), 493 states have internal predecessors, (644), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 594 states. [2022-02-20 23:49:04,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:04,557 INFO L93 Difference]: Finished difference Result 594 states and 768 transitions. [2022-02-20 23:49:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 768 transitions. [2022-02-20 23:49:04,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:04,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:04,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:04,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 453 states have (on average 1.4216335540838851) internal successors, (644), 493 states have internal predecessors, (644), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 680 transitions. [2022-02-20 23:49:04,566 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 680 transitions. Word has length 33 [2022-02-20 23:49:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:04,567 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 680 transitions. [2022-02-20 23:49:04,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 680 transitions. [2022-02-20 23:49:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:49:04,567 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:04,567 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:04,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-20 23:49:04,568 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:04,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:04,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1083493612, now seen corresponding path program 1 times [2022-02-20 23:49:04,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:04,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103365749] [2022-02-20 23:49:04,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:04,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:04,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:49:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:04,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {55183#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {55183#true} is VALID [2022-02-20 23:49:04,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {55183#true} assume true; {55183#true} is VALID [2022-02-20 23:49:04,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55183#true} {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #287#return; {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {55183#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short21#1 := ~i~0 < 3; {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short23#1 := main_~y~0#1 < 5; {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short28#1 := main_~z~0#1 < 10; {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,743 INFO L272 TraceCheckUtils]: 11: Hoare triple {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} call main_#t~ret29#1 := rand_end_point(); {55183#true} is VALID [2022-02-20 23:49:04,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {55183#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {55183#true} is VALID [2022-02-20 23:49:04,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {55183#true} assume true; {55183#true} is VALID [2022-02-20 23:49:04,744 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {55183#true} {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #287#return; {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:04,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {55185#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {55189#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (= |ULTIMATE.start_remove_one_~list#1.offset| |ULTIMATE.start_is_empty_~list#1.offset|))} is VALID [2022-02-20 23:49:04,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {55189#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (= |ULTIMATE.start_remove_one_~list#1.offset| |ULTIMATE.start_is_empty_~list#1.offset|))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {55190#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (= |ULTIMATE.start_remove_one_~list#1.offset| |ULTIMATE.start_is_empty_~list#1.offset|))} is VALID [2022-02-20 23:49:04,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {55190#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (= |ULTIMATE.start_remove_one_~list#1.offset| |ULTIMATE.start_is_empty_~list#1.offset|))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {55190#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (= |ULTIMATE.start_remove_one_~list#1.offset| |ULTIMATE.start_is_empty_~list#1.offset|))} is VALID [2022-02-20 23:49:04,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {55190#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (= |ULTIMATE.start_remove_one_~list#1.offset| |ULTIMATE.start_is_empty_~list#1.offset|))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:04,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:04,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10); {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:04,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is_empty_#res#1 := is_empty_~no_beg~0#1; {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:04,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} remove_one_#t~ret11#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret11#1 && remove_one_#t~ret11#1 <= 2147483647; {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:04,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(0 != remove_one_#t~ret11#1);havoc remove_one_#t~ret11#1; {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:04,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:04,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:04,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume remove_one_#t~mem12#1.base == remove_one_#t~mem13#1.base && remove_one_#t~mem12#1.offset == remove_one_#t~mem13#1.offset;havoc remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset;havoc remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset; {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:04,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L707 {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:04,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume 0 == remove_one_#t~mem14#1.offset; {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:04,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume remove_one_#t~mem14#1.base < #StackHeapBarrier; {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:04,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {55191#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume 0 == remove_one_#t~mem14#1.base || 1 == #valid[remove_one_#t~mem14#1.base];call ULTIMATE.dealloc(remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset);havoc remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {55192#(and (<= 0 (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (- 8)) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0))} is VALID [2022-02-20 23:49:04,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {55192#(and (<= 0 (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (- 8)) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {55192#(and (<= 0 (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (- 8)) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0))} is VALID [2022-02-20 23:49:04,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {55192#(and (<= 0 (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (- 8)) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0))} assume !(#Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset); {55184#false} is VALID [2022-02-20 23:49:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:04,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:04,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103365749] [2022-02-20 23:49:04,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103365749] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:04,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:04,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:49:04,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724420833] [2022-02-20 23:49:04,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:04,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-20 23:49:04,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:04,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:04,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:04,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:49:04,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:04,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:49:04,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:49:04,787 INFO L87 Difference]: Start difference. First operand 518 states and 680 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,761 INFO L93 Difference]: Finished difference Result 668 states and 826 transitions. [2022-02-20 23:49:05,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:49:05,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-20 23:49:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 350 transitions. [2022-02-20 23:49:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 350 transitions. [2022-02-20 23:49:05,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 350 transitions. [2022-02-20 23:49:06,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 350 edges. 350 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:06,096 INFO L225 Difference]: With dead ends: 668 [2022-02-20 23:49:06,096 INFO L226 Difference]: Without dead ends: 668 [2022-02-20 23:49:06,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:49:06,098 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 521 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:06,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [521 Valid, 582 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:49:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-02-20 23:49:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 518. [2022-02-20 23:49:06,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:06,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 668 states. Second operand has 518 states, 453 states have (on average 1.4105960264900663) internal successors, (639), 493 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:06,112 INFO L74 IsIncluded]: Start isIncluded. First operand 668 states. Second operand has 518 states, 453 states have (on average 1.4105960264900663) internal successors, (639), 493 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:06,113 INFO L87 Difference]: Start difference. First operand 668 states. Second operand has 518 states, 453 states have (on average 1.4105960264900663) internal successors, (639), 493 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:06,130 INFO L93 Difference]: Finished difference Result 668 states and 826 transitions. [2022-02-20 23:49:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 826 transitions. [2022-02-20 23:49:06,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:06,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:06,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 518 states, 453 states have (on average 1.4105960264900663) internal successors, (639), 493 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 668 states. [2022-02-20 23:49:06,133 INFO L87 Difference]: Start difference. First operand has 518 states, 453 states have (on average 1.4105960264900663) internal successors, (639), 493 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 668 states. [2022-02-20 23:49:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:06,151 INFO L93 Difference]: Finished difference Result 668 states and 826 transitions. [2022-02-20 23:49:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 826 transitions. [2022-02-20 23:49:06,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:06,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:06,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:06,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 453 states have (on average 1.4105960264900663) internal successors, (639), 493 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 675 transitions. [2022-02-20 23:49:06,164 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 675 transitions. Word has length 33 [2022-02-20 23:49:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:06,165 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 675 transitions. [2022-02-20 23:49:06,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 675 transitions. [2022-02-20 23:49:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:49:06,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:06,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:06,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-20 23:49:06,166 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:06,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2113699762, now seen corresponding path program 1 times [2022-02-20 23:49:06,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:06,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909643291] [2022-02-20 23:49:06,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:06,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:06,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:49:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:06,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {57729#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {57729#true} is VALID [2022-02-20 23:49:06,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {57729#true} assume true; {57729#true} is VALID [2022-02-20 23:49:06,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57729#true} {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} #287#return; {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {57729#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} main_#t~short21#1 := ~i~0 < 3; {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,417 INFO L290 TraceCheckUtils]: 4: Hoare triple {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} main_#t~short23#1 := main_~y~0#1 < 5; {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} main_#t~short28#1 := main_~z~0#1 < 10; {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,420 INFO L272 TraceCheckUtils]: 11: Hoare triple {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} call main_#t~ret29#1 := rand_end_point(); {57729#true} is VALID [2022-02-20 23:49:06,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {57729#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {57729#true} is VALID [2022-02-20 23:49:06,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {57729#true} assume true; {57729#true} is VALID [2022-02-20 23:49:06,421 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {57729#true} {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} #287#return; {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:06,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {57731#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:06,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:06,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:06,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:06,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:06,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10); {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:06,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is_empty_#res#1 := is_empty_~no_beg~0#1; {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:06,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} remove_one_#t~ret11#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret11#1 && remove_one_#t~ret11#1 <= 2147483647; {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:06,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} assume !(0 != remove_one_#t~ret11#1);havoc remove_one_#t~ret11#1; {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:06,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {57735#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} SUMMARY for call remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {57736#(and (= |ULTIMATE.start_remove_one_#t~mem12#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= |ULTIMATE.start_remove_one_#t~mem12#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))))} is VALID [2022-02-20 23:49:06,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {57736#(and (= |ULTIMATE.start_remove_one_#t~mem12#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= |ULTIMATE.start_remove_one_#t~mem12#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))))} SUMMARY for call remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {57737#(and (= |ULTIMATE.start_remove_one_#t~mem13#1.offset| |ULTIMATE.start_remove_one_#t~mem12#1.offset|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= |ULTIMATE.start_remove_one_#t~mem12#1.base| |ULTIMATE.start_remove_one_#t~mem13#1.base|))} is VALID [2022-02-20 23:49:06,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {57737#(and (= |ULTIMATE.start_remove_one_#t~mem13#1.offset| |ULTIMATE.start_remove_one_#t~mem12#1.offset|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= |ULTIMATE.start_remove_one_#t~mem12#1.base| |ULTIMATE.start_remove_one_#t~mem13#1.base|))} assume !(remove_one_#t~mem12#1.base == remove_one_#t~mem13#1.base && remove_one_#t~mem12#1.offset == remove_one_#t~mem13#1.offset);havoc remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset;havoc remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset; {57730#false} is VALID [2022-02-20 23:49:06,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {57730#false} assume ~unnamed1~0~LIST_BEG == remove_one_~from#1;remove_one_#t~ite16#1 := ~unnamed2~0~ITEM_NEXT; {57730#false} is VALID [2022-02-20 23:49:06,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {57730#false} remove_one_~next_field~0#1 := remove_one_#t~ite16#1;havoc remove_one_#t~ite16#1; {57730#false} is VALID [2022-02-20 23:49:06,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {57730#false} assume !(~unnamed1~0~LIST_END == remove_one_~from#1);remove_one_#t~ite17#1 := ~unnamed2~0~ITEM_PREV; {57730#false} is VALID [2022-02-20 23:49:06,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {57730#false} remove_one_~term_field~1#1 := remove_one_#t~ite17#1;havoc remove_one_#t~ite17#1; {57730#false} is VALID [2022-02-20 23:49:06,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {57730#false} SUMMARY for call remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * remove_one_~from#1, 4); srcloc: L713 {57730#false} is VALID [2022-02-20 23:49:06,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {57730#false} remove_one_~item~2#1.base, remove_one_~item~2#1.offset := remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset;havoc remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset; {57730#false} is VALID [2022-02-20 23:49:06,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {57730#false} assume !(1 == #valid[remove_one_~item~2#1.base]); {57730#false} is VALID [2022-02-20 23:49:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:06,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:06,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909643291] [2022-02-20 23:49:06,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909643291] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:06,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:06,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:49:06,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656757334] [2022-02-20 23:49:06,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:06,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 23:49:06,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:06,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:06,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:06,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:49:06,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:06,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:49:06,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:06,458 INFO L87 Difference]: Start difference. First operand 518 states and 675 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:07,078 INFO L93 Difference]: Finished difference Result 556 states and 716 transitions. [2022-02-20 23:49:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:07,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 23:49:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 235 transitions. [2022-02-20 23:49:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 235 transitions. [2022-02-20 23:49:07,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 235 transitions. [2022-02-20 23:49:07,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:07,260 INFO L225 Difference]: With dead ends: 556 [2022-02-20 23:49:07,260 INFO L226 Difference]: Without dead ends: 556 [2022-02-20 23:49:07,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:49:07,264 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 99 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:07,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 680 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-02-20 23:49:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 518. [2022-02-20 23:49:07,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:07,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 556 states. Second operand has 518 states, 453 states have (on average 1.4061810154525387) internal successors, (637), 493 states have internal predecessors, (637), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:07,271 INFO L74 IsIncluded]: Start isIncluded. First operand 556 states. Second operand has 518 states, 453 states have (on average 1.4061810154525387) internal successors, (637), 493 states have internal predecessors, (637), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:07,271 INFO L87 Difference]: Start difference. First operand 556 states. Second operand has 518 states, 453 states have (on average 1.4061810154525387) internal successors, (637), 493 states have internal predecessors, (637), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:07,280 INFO L93 Difference]: Finished difference Result 556 states and 716 transitions. [2022-02-20 23:49:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 716 transitions. [2022-02-20 23:49:07,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:07,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:07,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 518 states, 453 states have (on average 1.4061810154525387) internal successors, (637), 493 states have internal predecessors, (637), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 556 states. [2022-02-20 23:49:07,282 INFO L87 Difference]: Start difference. First operand has 518 states, 453 states have (on average 1.4061810154525387) internal successors, (637), 493 states have internal predecessors, (637), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 556 states. [2022-02-20 23:49:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:07,296 INFO L93 Difference]: Finished difference Result 556 states and 716 transitions. [2022-02-20 23:49:07,296 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 716 transitions. [2022-02-20 23:49:07,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:07,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:07,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:07,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 453 states have (on average 1.4061810154525387) internal successors, (637), 493 states have internal predecessors, (637), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 673 transitions. [2022-02-20 23:49:07,307 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 673 transitions. Word has length 34 [2022-02-20 23:49:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:07,307 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 673 transitions. [2022-02-20 23:49:07,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 673 transitions. [2022-02-20 23:49:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:49:07,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:07,308 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:07,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-20 23:49:07,308 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:07,309 INFO L85 PathProgramCache]: Analyzing trace with hash 949188435, now seen corresponding path program 1 times [2022-02-20 23:49:07,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:07,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939373727] [2022-02-20 23:49:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:07,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:07,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {59932#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {59932#true} is VALID [2022-02-20 23:49:07,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {59932#true} assume true; {59932#true} is VALID [2022-02-20 23:49:07,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59932#true} {59932#true} #285#return; {59932#true} is VALID [2022-02-20 23:49:07,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 23:49:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:07,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {59932#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {59932#true} is VALID [2022-02-20 23:49:07,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {59932#true} assume true; {59932#true} is VALID [2022-02-20 23:49:07,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59932#true} {59933#false} #285#return; {59933#false} is VALID [2022-02-20 23:49:07,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {59932#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {59932#true} is VALID [2022-02-20 23:49:07,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {59932#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {59932#true} is VALID [2022-02-20 23:49:07,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {59932#true} main_#t~short21#1 := ~i~0 < 3; {59932#true} is VALID [2022-02-20 23:49:07,351 INFO L290 TraceCheckUtils]: 3: Hoare triple {59932#true} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {59932#true} is VALID [2022-02-20 23:49:07,351 INFO L290 TraceCheckUtils]: 4: Hoare triple {59932#true} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {59932#true} is VALID [2022-02-20 23:49:07,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {59932#true} main_#t~short23#1 := main_~y~0#1 < 5; {59932#true} is VALID [2022-02-20 23:49:07,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {59932#true} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {59932#true} is VALID [2022-02-20 23:49:07,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {59932#true} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {59932#true} is VALID [2022-02-20 23:49:07,351 INFO L272 TraceCheckUtils]: 8: Hoare triple {59932#true} call main_#t~ret24#1 := rand_end_point(); {59932#true} is VALID [2022-02-20 23:49:07,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {59932#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {59932#true} is VALID [2022-02-20 23:49:07,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {59932#true} assume true; {59932#true} is VALID [2022-02-20 23:49:07,352 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {59932#true} {59932#true} #285#return; {59932#true} is VALID [2022-02-20 23:49:07,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {59932#true} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {59932#true} is VALID [2022-02-20 23:49:07,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {59932#true} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {59932#true} is VALID [2022-02-20 23:49:07,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {59932#true} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {59932#true} is VALID [2022-02-20 23:49:07,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {59932#true} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {59932#true} is VALID [2022-02-20 23:49:07,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {59932#true} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {59932#true} is VALID [2022-02-20 23:49:07,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {59932#true} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {59932#true} is VALID [2022-02-20 23:49:07,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {59932#true} havoc create_item_#t~switch6#1; {59932#true} is VALID [2022-02-20 23:49:07,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {59932#true} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {59932#true} is VALID [2022-02-20 23:49:07,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {59932#true} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {59932#true} is VALID [2022-02-20 23:49:07,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {59932#true} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {59932#true} is VALID [2022-02-20 23:49:07,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {59932#true} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {59932#true} is VALID [2022-02-20 23:49:07,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {59932#true} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {59932#true} is VALID [2022-02-20 23:49:07,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {59932#true} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {59932#true} is VALID [2022-02-20 23:49:07,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {59932#true} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {59932#true} is VALID [2022-02-20 23:49:07,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {59932#true} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {59932#true} is VALID [2022-02-20 23:49:07,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {59932#true} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {59932#true} is VALID [2022-02-20 23:49:07,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {59932#true} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {59932#true} is VALID [2022-02-20 23:49:07,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {59932#true} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {59932#true} is VALID [2022-02-20 23:49:07,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {59932#true} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {59932#true} is VALID [2022-02-20 23:49:07,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {59932#true} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {59932#true} is VALID [2022-02-20 23:49:07,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {59932#true} main_#t~short23#1 := main_~y~0#1 < 5; {59932#true} is VALID [2022-02-20 23:49:07,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {59932#true} assume !main_#t~short23#1; {59937#(not |ULTIMATE.start_main_#t~short23#1|)} is VALID [2022-02-20 23:49:07,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {59937#(not |ULTIMATE.start_main_#t~short23#1|)} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {59933#false} is VALID [2022-02-20 23:49:07,355 INFO L272 TraceCheckUtils]: 35: Hoare triple {59933#false} call main_#t~ret24#1 := rand_end_point(); {59932#true} is VALID [2022-02-20 23:49:07,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {59932#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {59932#true} is VALID [2022-02-20 23:49:07,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {59932#true} assume true; {59932#true} is VALID [2022-02-20 23:49:07,355 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {59932#true} {59933#false} #285#return; {59933#false} is VALID [2022-02-20 23:49:07,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {59933#false} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {59933#false} is VALID [2022-02-20 23:49:07,355 INFO L290 TraceCheckUtils]: 40: Hoare triple {59933#false} assume !(4 + (append_one_~list#1.offset + 4 * append_one_~to#1) <= #length[append_one_~list#1.base] && 0 <= append_one_~list#1.offset + 4 * append_one_~to#1); {59933#false} is VALID [2022-02-20 23:49:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 23:49:07,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:07,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939373727] [2022-02-20 23:49:07,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939373727] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:07,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:07,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:49:07,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980070174] [2022-02-20 23:49:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:07,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-02-20 23:49:07,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:07,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:07,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:07,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:49:07,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:49:07,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:49:07,378 INFO L87 Difference]: Start difference. First operand 518 states and 673 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:07,489 INFO L93 Difference]: Finished difference Result 520 states and 675 transitions. [2022-02-20 23:49:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:49:07,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-02-20 23:49:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-02-20 23:49:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-02-20 23:49:07,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2022-02-20 23:49:07,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:07,584 INFO L225 Difference]: With dead ends: 520 [2022-02-20 23:49:07,585 INFO L226 Difference]: Without dead ends: 520 [2022-02-20 23:49:07,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:49:07,585 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:07,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-02-20 23:49:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2022-02-20 23:49:07,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:07,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 520 states. Second operand has 520 states, 455 states have (on average 1.4043956043956043) internal successors, (639), 495 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:07,592 INFO L74 IsIncluded]: Start isIncluded. First operand 520 states. Second operand has 520 states, 455 states have (on average 1.4043956043956043) internal successors, (639), 495 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:07,593 INFO L87 Difference]: Start difference. First operand 520 states. Second operand has 520 states, 455 states have (on average 1.4043956043956043) internal successors, (639), 495 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:07,601 INFO L93 Difference]: Finished difference Result 520 states and 675 transitions. [2022-02-20 23:49:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 675 transitions. [2022-02-20 23:49:07,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:07,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:07,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 520 states, 455 states have (on average 1.4043956043956043) internal successors, (639), 495 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 520 states. [2022-02-20 23:49:07,602 INFO L87 Difference]: Start difference. First operand has 520 states, 455 states have (on average 1.4043956043956043) internal successors, (639), 495 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 520 states. [2022-02-20 23:49:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:07,611 INFO L93 Difference]: Finished difference Result 520 states and 675 transitions. [2022-02-20 23:49:07,611 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 675 transitions. [2022-02-20 23:49:07,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:07,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:07,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:07,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 455 states have (on average 1.4043956043956043) internal successors, (639), 495 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 675 transitions. [2022-02-20 23:49:07,622 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 675 transitions. Word has length 41 [2022-02-20 23:49:07,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:07,623 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 675 transitions. [2022-02-20 23:49:07,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 675 transitions. [2022-02-20 23:49:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:49:07,623 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:07,623 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:07,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-20 23:49:07,624 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:07,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:07,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1758535061, now seen corresponding path program 1 times [2022-02-20 23:49:07,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:07,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721520237] [2022-02-20 23:49:07,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:07,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:07,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:07,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {62023#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:07,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:07,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #285#return; {62029#(and (<= (+ |~#list~0.offset| (* 8 |ULTIMATE.start_main_#t~ret24#1|)) (* ~unnamed1~0~LIST_BEG 8)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)))} is VALID [2022-02-20 23:49:07,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 23:49:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:07,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {62023#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:07,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:07,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} #285#return; {62040#(and (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (* ~unnamed1~0~LIST_BEG 8) (select |#length| |~#list~0.base|))) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)))} is VALID [2022-02-20 23:49:07,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {62023#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short21#1 := ~i~0 < 3; {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,976 INFO L290 TraceCheckUtils]: 4: Hoare triple {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short23#1 := main_~y~0#1 < 5; {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,977 INFO L272 TraceCheckUtils]: 8: Hoare triple {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret24#1 := rand_end_point(); {62023#true} is VALID [2022-02-20 23:49:07,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {62023#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:07,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:07,978 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {62025#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #285#return; {62029#(and (<= (+ |~#list~0.offset| (* 8 |ULTIMATE.start_main_#t~ret24#1|)) (* ~unnamed1~0~LIST_BEG 8)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)))} is VALID [2022-02-20 23:49:07,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {62029#(and (<= (+ |~#list~0.offset| (* 8 |ULTIMATE.start_main_#t~ret24#1|)) (* ~unnamed1~0~LIST_BEG 8)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {62030#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* 8 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 8)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)))} is VALID [2022-02-20 23:49:07,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {62030#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* 8 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 8)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {62031#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:07,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {62031#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {62032#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:07,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {62032#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {62032#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:07,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {62032#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {62033#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (or (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (not |ULTIMATE.start_create_item_#t~switch6#1|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:07,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {62033#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (or (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (not |ULTIMATE.start_create_item_#t~switch6#1|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:07,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} havoc create_item_#t~switch6#1; {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:07,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:07,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:07,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:08,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:08,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:08,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:08,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:08,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {62034#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {62035#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:08,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {62035#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {62035#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:08,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {62035#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {62035#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:08,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {62035#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:08,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:08,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:08,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} main_#t~short23#1 := main_~y~0#1 < 5; {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:08,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:08,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:08,005 INFO L272 TraceCheckUtils]: 35: Hoare triple {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} call main_#t~ret24#1 := rand_end_point(); {62023#true} is VALID [2022-02-20 23:49:08,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {62023#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:08,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:08,006 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {62042#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {62036#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} #285#return; {62040#(and (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (* ~unnamed1~0~LIST_BEG 8) (select |#length| |~#list~0.base|))) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)))} is VALID [2022-02-20 23:49:08,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {62040#(and (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (* ~unnamed1~0~LIST_BEG 8) (select |#length| |~#list~0.base|))) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {62041#(and (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_append_one_~list#1.offset| 4) (+ (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 8))))} is VALID [2022-02-20 23:49:08,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {62041#(and (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_append_one_~list#1.offset| 4) (+ (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 8))))} assume !(4 + (append_one_~list#1.offset + 4 * append_one_~to#1) <= #length[append_one_~list#1.base] && 0 <= append_one_~list#1.offset + 4 * append_one_~to#1); {62024#false} is VALID [2022-02-20 23:49:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:08,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:08,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721520237] [2022-02-20 23:49:08,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721520237] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:08,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554915440] [2022-02-20 23:49:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:08,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:08,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:08,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:08,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:49:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:08,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:49:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:08,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:08,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {62023#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short21#1 := ~i~0 < 3; {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short23#1 := main_~y~0#1 < 5; {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,544 INFO L272 TraceCheckUtils]: 8: Hoare triple {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} call main_#t~ret24#1 := rand_end_point(); {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume true; {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,545 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} #285#return; {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {62046#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} havoc create_item_#t~switch6#1; {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {62083#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {62129#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {62129#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {62129#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {62129#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short23#1 := main_~y~0#1 < 5; {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,555 INFO L272 TraceCheckUtils]: 35: Hoare triple {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} call main_#t~ret24#1 := rand_end_point(); {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:08,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {62158#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= ~unnamed1~0~LIST_BEG |rand_end_point_#res|))} is VALID [2022-02-20 23:49:08,556 INFO L290 TraceCheckUtils]: 37: Hoare triple {62158#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= ~unnamed1~0~LIST_BEG |rand_end_point_#res|))} assume true; {62158#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= ~unnamed1~0~LIST_BEG |rand_end_point_#res|))} is VALID [2022-02-20 23:49:08,557 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {62158#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= ~unnamed1~0~LIST_BEG |rand_end_point_#res|))} {62136#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} #285#return; {62165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret24#1|))} is VALID [2022-02-20 23:49:08,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {62165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret24#1|))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {62169#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| 3) (* ~unnamed1~0~LIST_BEG 4))) (= 3 |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:08,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {62169#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| 3) (* ~unnamed1~0~LIST_BEG 4))) (= 3 |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(4 + (append_one_~list#1.offset + 4 * append_one_~to#1) <= #length[append_one_~list#1.base] && 0 <= append_one_~list#1.offset + 4 * append_one_~to#1); {62024#false} is VALID [2022-02-20 23:49:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:08,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:08,800 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:49:08,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2022-02-20 23:49:09,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {62173#(and (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (<= 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|)))} assume !(4 + (append_one_~list#1.offset + 4 * append_one_~to#1) <= #length[append_one_~list#1.base] && 0 <= append_one_~list#1.offset + 4 * append_one_~to#1); {62024#false} is VALID [2022-02-20 23:49:09,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {62177#(and (<= 0 (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {62173#(and (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (<= 0 (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:09,159 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {62185#(or (not (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))) (and (<= 0 (+ |~#list~0.offset| (* 4 |rand_end_point_#res|))) (<= (+ |~#list~0.offset| 4 (* 4 |rand_end_point_#res|)) (select |#length| |~#list~0.base|))) (not (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|))))} {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} #285#return; {62177#(and (<= 0 (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)))} is VALID [2022-02-20 23:49:09,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {62185#(or (not (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))) (and (<= 0 (+ |~#list~0.offset| (* 4 |rand_end_point_#res|))) (<= (+ |~#list~0.offset| 4 (* 4 |rand_end_point_#res|)) (select |#length| |~#list~0.base|))) (not (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|))))} assume true; {62185#(or (not (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))) (and (<= 0 (+ |~#list~0.offset| (* 4 |rand_end_point_#res|))) (<= (+ |~#list~0.offset| 4 (* 4 |rand_end_point_#res|)) (select |#length| |~#list~0.base|))) (not (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|))))} is VALID [2022-02-20 23:49:09,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {62023#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {62185#(or (not (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))) (and (<= 0 (+ |~#list~0.offset| (* 4 |rand_end_point_#res|))) (<= (+ |~#list~0.offset| 4 (* 4 |rand_end_point_#res|)) (select |#length| |~#list~0.base|))) (not (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|))))} is VALID [2022-02-20 23:49:09,160 INFO L272 TraceCheckUtils]: 35: Hoare triple {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} call main_#t~ret24#1 := rand_end_point(); {62023#true} is VALID [2022-02-20 23:49:09,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} main_#t~short23#1 := main_~y~0#1 < 5; {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {62210#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_append_one_~list#1.offset|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {62181#(and (<= (+ |~#list~0.offset| 4 (* ~unnamed1~0~LIST_BEG 4)) (select |#length| |~#list~0.base|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {62210#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_append_one_~list#1.offset|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {62210#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_append_one_~list#1.offset|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {62210#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_append_one_~list#1.offset|)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} havoc create_item_#t~switch6#1; {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {62217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,170 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {62023#true} {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} #285#return; {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {62023#true} assume true; {62023#true} is VALID [2022-02-20 23:49:09,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {62023#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {62023#true} is VALID [2022-02-20 23:49:09,170 INFO L272 TraceCheckUtils]: 8: Hoare triple {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} call main_#t~ret24#1 := rand_end_point(); {62023#true} is VALID [2022-02-20 23:49:09,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} main_#t~short23#1 := main_~y~0#1 < 5; {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} main_#t~short21#1 := ~i~0 < 3; {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {62023#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {62263#(and (<= (+ (* ~unnamed1~0~LIST_BEG 8) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)) (<= 0 (+ |~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:49:09,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554915440] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:09,174 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:09,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 8] total 27 [2022-02-20 23:49:09,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056059275] [2022-02-20 23:49:09,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:09,175 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2022-02-20 23:49:09,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:09,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:09,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:09,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-20 23:49:09,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:09,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-20 23:49:09,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2022-02-20 23:49:09,259 INFO L87 Difference]: Start difference. First operand 520 states and 675 transitions. Second operand has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:11,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:11,405 INFO L93 Difference]: Finished difference Result 545 states and 676 transitions. [2022-02-20 23:49:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:49:11,406 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2022-02-20 23:49:11,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 238 transitions. [2022-02-20 23:49:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 238 transitions. [2022-02-20 23:49:11,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 238 transitions. [2022-02-20 23:49:11,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:11,572 INFO L225 Difference]: With dead ends: 545 [2022-02-20 23:49:11,572 INFO L226 Difference]: Without dead ends: 545 [2022-02-20 23:49:11,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2022-02-20 23:49:11,574 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 1662 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:11,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1664 Valid, 1374 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:49:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-02-20 23:49:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 517. [2022-02-20 23:49:11,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:11,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 545 states. Second operand has 517 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 493 states have internal predecessors, (634), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:11,586 INFO L74 IsIncluded]: Start isIncluded. First operand 545 states. Second operand has 517 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 493 states have internal predecessors, (634), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:11,587 INFO L87 Difference]: Start difference. First operand 545 states. Second operand has 517 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 493 states have internal predecessors, (634), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:11,597 INFO L93 Difference]: Finished difference Result 545 states and 676 transitions. [2022-02-20 23:49:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 676 transitions. [2022-02-20 23:49:11,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:11,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:11,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 517 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 493 states have internal predecessors, (634), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) Second operand 545 states. [2022-02-20 23:49:11,599 INFO L87 Difference]: Start difference. First operand has 517 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 493 states have internal predecessors, (634), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) Second operand 545 states. [2022-02-20 23:49:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:11,612 INFO L93 Difference]: Finished difference Result 545 states and 676 transitions. [2022-02-20 23:49:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 676 transitions. [2022-02-20 23:49:11,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:11,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:11,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:11,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 493 states have internal predecessors, (634), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 23:49:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 670 transitions. [2022-02-20 23:49:11,647 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 670 transitions. Word has length 41 [2022-02-20 23:49:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:11,649 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 670 transitions. [2022-02-20 23:49:11,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 670 transitions. [2022-02-20 23:49:11,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 23:49:11,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:11,650 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:11,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:11,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-02-20 23:49:11,850 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:11,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1516271307, now seen corresponding path program 1 times [2022-02-20 23:49:11,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:11,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067495345] [2022-02-20 23:49:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:11,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:11,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {64457#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {64457#true} is VALID [2022-02-20 23:49:11,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {64457#true} assume true; {64457#true} is VALID [2022-02-20 23:49:11,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64457#true} {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} #285#return; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 23:49:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:11,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {64457#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {64457#true} is VALID [2022-02-20 23:49:11,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {64457#true} assume true; {64457#true} is VALID [2022-02-20 23:49:11,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64457#true} {64458#false} #287#return; {64458#false} is VALID [2022-02-20 23:49:11,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {64457#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {64457#true} is VALID [2022-02-20 23:49:11,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {64457#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~short21#1 := ~i~0 < 3; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~short23#1 := main_~y~0#1 < 5; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,928 INFO L272 TraceCheckUtils]: 8: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} call main_#t~ret24#1 := rand_end_point(); {64457#true} is VALID [2022-02-20 23:49:11,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {64457#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {64457#true} is VALID [2022-02-20 23:49:11,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {64457#true} assume true; {64457#true} is VALID [2022-02-20 23:49:11,928 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {64457#true} {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} #285#return; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} havoc create_item_#t~switch6#1; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:11,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {64459#(= |ULTIMATE.start_main_~y~0#1| 0)} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {64463#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-20 23:49:11,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {64463#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_#t~short23#1 := main_~y~0#1 < 5; {64464#|ULTIMATE.start_main_#t~short23#1|} is VALID [2022-02-20 23:49:11,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {64464#|ULTIMATE.start_main_#t~short23#1|} assume !main_#t~short23#1; {64458#false} is VALID [2022-02-20 23:49:11,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {64458#false} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {64458#false} is VALID [2022-02-20 23:49:11,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {64458#false} main_#t~short28#1 := main_~z~0#1 < 10; {64458#false} is VALID [2022-02-20 23:49:11,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {64458#false} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {64458#false} is VALID [2022-02-20 23:49:11,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {64458#false} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {64458#false} is VALID [2022-02-20 23:49:11,935 INFO L272 TraceCheckUtils]: 38: Hoare triple {64458#false} call main_#t~ret29#1 := rand_end_point(); {64457#true} is VALID [2022-02-20 23:49:11,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {64457#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {64457#true} is VALID [2022-02-20 23:49:11,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {64457#true} assume true; {64457#true} is VALID [2022-02-20 23:49:11,936 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {64457#true} {64458#false} #287#return; {64458#false} is VALID [2022-02-20 23:49:11,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {64458#false} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {64458#false} is VALID [2022-02-20 23:49:11,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {64458#false} assume !(4 + (is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[is_empty_~list#1.base] && 0 <= is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {64458#false} is VALID [2022-02-20 23:49:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:11,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:11,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067495345] [2022-02-20 23:49:11,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067495345] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:11,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628503946] [2022-02-20 23:49:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:11,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:11,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:11,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:11,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:49:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:12,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:12,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:12,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {64457#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {64457#true} is VALID [2022-02-20 23:49:12,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {64457#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~short21#1 := ~i~0 < 3; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,237 INFO L290 TraceCheckUtils]: 4: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~short23#1 := main_~y~0#1 < 5; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,238 INFO L272 TraceCheckUtils]: 8: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} call main_#t~ret24#1 := rand_end_point(); {64457#true} is VALID [2022-02-20 23:49:12,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {64457#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {64457#true} is VALID [2022-02-20 23:49:12,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {64457#true} assume true; {64457#true} is VALID [2022-02-20 23:49:12,239 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {64457#true} {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} #285#return; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} havoc create_item_#t~switch6#1; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 23:49:12,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {64474#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {64463#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-20 23:49:12,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {64463#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_#t~short23#1 := main_~y~0#1 < 5; {64464#|ULTIMATE.start_main_#t~short23#1|} is VALID [2022-02-20 23:49:12,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {64464#|ULTIMATE.start_main_#t~short23#1|} assume !main_#t~short23#1; {64458#false} is VALID [2022-02-20 23:49:12,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {64458#false} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {64458#false} is VALID [2022-02-20 23:49:12,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {64458#false} main_#t~short28#1 := main_~z~0#1 < 10; {64458#false} is VALID [2022-02-20 23:49:12,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {64458#false} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {64458#false} is VALID [2022-02-20 23:49:12,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {64458#false} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {64458#false} is VALID [2022-02-20 23:49:12,247 INFO L272 TraceCheckUtils]: 38: Hoare triple {64458#false} call main_#t~ret29#1 := rand_end_point(); {64458#false} is VALID [2022-02-20 23:49:12,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {64458#false} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {64458#false} is VALID [2022-02-20 23:49:12,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {64458#false} assume true; {64458#false} is VALID [2022-02-20 23:49:12,247 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {64458#false} {64458#false} #287#return; {64458#false} is VALID [2022-02-20 23:49:12,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {64458#false} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {64458#false} is VALID [2022-02-20 23:49:12,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {64458#false} assume !(4 + (is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[is_empty_~list#1.base] && 0 <= is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {64458#false} is VALID [2022-02-20 23:49:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:12,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:12,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {64458#false} assume !(4 + (is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[is_empty_~list#1.base] && 0 <= is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {64458#false} is VALID [2022-02-20 23:49:12,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {64458#false} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {64458#false} is VALID [2022-02-20 23:49:12,399 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {64457#true} {64458#false} #287#return; {64458#false} is VALID [2022-02-20 23:49:12,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {64457#true} assume true; {64457#true} is VALID [2022-02-20 23:49:12,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {64457#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {64457#true} is VALID [2022-02-20 23:49:12,399 INFO L272 TraceCheckUtils]: 38: Hoare triple {64458#false} call main_#t~ret29#1 := rand_end_point(); {64457#true} is VALID [2022-02-20 23:49:12,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {64458#false} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {64458#false} is VALID [2022-02-20 23:49:12,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {64458#false} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {64458#false} is VALID [2022-02-20 23:49:12,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {64458#false} main_#t~short28#1 := main_~z~0#1 < 10; {64458#false} is VALID [2022-02-20 23:49:12,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {64458#false} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {64458#false} is VALID [2022-02-20 23:49:12,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {64464#|ULTIMATE.start_main_#t~short23#1|} assume !main_#t~short23#1; {64458#false} is VALID [2022-02-20 23:49:12,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {64634#(< |ULTIMATE.start_main_~y~0#1| 5)} main_#t~short23#1 := main_~y~0#1 < 5; {64464#|ULTIMATE.start_main_#t~short23#1|} is VALID [2022-02-20 23:49:12,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {64634#(< |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-20 23:49:12,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} havoc create_item_#t~switch6#1; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,406 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {64457#true} {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} #285#return; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {64457#true} assume true; {64457#true} is VALID [2022-02-20 23:49:12,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {64457#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {64457#true} is VALID [2022-02-20 23:49:12,406 INFO L272 TraceCheckUtils]: 8: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} call main_#t~ret24#1 := rand_end_point(); {64457#true} is VALID [2022-02-20 23:49:12,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} main_#t~short23#1 := main_~y~0#1 < 5; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,407 INFO L290 TraceCheckUtils]: 4: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} main_#t~short21#1 := ~i~0 < 3; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {64457#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {64638#(< |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-20 23:49:12,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {64457#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {64457#true} is VALID [2022-02-20 23:49:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:12,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628503946] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:12,409 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:12,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-02-20 23:49:12,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608980481] [2022-02-20 23:49:12,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2022-02-20 23:49:12,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:12,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:49:12,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:12,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:49:12,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:12,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:49:12,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:49:12,469 INFO L87 Difference]: Start difference. First operand 517 states and 670 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:49:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:13,036 INFO L93 Difference]: Finished difference Result 1213 states and 1554 transitions. [2022-02-20 23:49:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:49:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2022-02-20 23:49:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:49:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 594 transitions. [2022-02-20 23:49:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:49:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 594 transitions. [2022-02-20 23:49:13,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 594 transitions. [2022-02-20 23:49:13,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:13,512 INFO L225 Difference]: With dead ends: 1213 [2022-02-20 23:49:13,512 INFO L226 Difference]: Without dead ends: 1213 [2022-02-20 23:49:13,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:49:13,515 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 506 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:13,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 1019 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-02-20 23:49:13,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 679. [2022-02-20 23:49:13,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:13,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1213 states. Second operand has 679 states, 609 states have (on average 1.361247947454844) internal successors, (829), 649 states have internal predecessors, (829), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 23:49:13,556 INFO L74 IsIncluded]: Start isIncluded. First operand 1213 states. Second operand has 679 states, 609 states have (on average 1.361247947454844) internal successors, (829), 649 states have internal predecessors, (829), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 23:49:13,557 INFO L87 Difference]: Start difference. First operand 1213 states. Second operand has 679 states, 609 states have (on average 1.361247947454844) internal successors, (829), 649 states have internal predecessors, (829), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 23:49:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:13,612 INFO L93 Difference]: Finished difference Result 1213 states and 1554 transitions. [2022-02-20 23:49:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1554 transitions. [2022-02-20 23:49:13,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:13,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:13,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 679 states, 609 states have (on average 1.361247947454844) internal successors, (829), 649 states have internal predecessors, (829), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) Second operand 1213 states. [2022-02-20 23:49:13,615 INFO L87 Difference]: Start difference. First operand has 679 states, 609 states have (on average 1.361247947454844) internal successors, (829), 649 states have internal predecessors, (829), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) Second operand 1213 states. [2022-02-20 23:49:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:13,656 INFO L93 Difference]: Finished difference Result 1213 states and 1554 transitions. [2022-02-20 23:49:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1554 transitions. [2022-02-20 23:49:13,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:13,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:13,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:13,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 609 states have (on average 1.361247947454844) internal successors, (829), 649 states have internal predecessors, (829), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 23:49:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 877 transitions. [2022-02-20 23:49:13,671 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 877 transitions. Word has length 44 [2022-02-20 23:49:13,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:13,672 INFO L470 AbstractCegarLoop]: Abstraction has 679 states and 877 transitions. [2022-02-20 23:49:13,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:49:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 877 transitions. [2022-02-20 23:49:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 23:49:13,672 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:13,672 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:13,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:13,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:13,889 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:13,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2077631411, now seen corresponding path program 1 times [2022-02-20 23:49:13,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:13,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286551349] [2022-02-20 23:49:13,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:13,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:14,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:14,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {69057#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {69071#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:49:14,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {69071#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {69071#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:49:14,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69071#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #285#return; {69063#(and (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 23:49:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:14,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {69057#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {69057#true} is VALID [2022-02-20 23:49:14,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {69057#true} assume true; {69057#true} is VALID [2022-02-20 23:49:14,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69057#true} {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} #287#return; {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {69057#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:14,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:14,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short21#1 := ~i~0 < 3; {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:14,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:14,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:14,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short23#1 := main_~y~0#1 < 5; {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:14,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:14,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:14,085 INFO L272 TraceCheckUtils]: 8: Hoare triple {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret24#1 := rand_end_point(); {69057#true} is VALID [2022-02-20 23:49:14,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {69057#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {69071#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:49:14,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {69071#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {69071#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:49:14,100 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {69071#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {69059#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #285#return; {69063#(and (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {69063#(and (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (<= 0 |~#list~0.offset|))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {69064#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {69064#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} havoc create_item_#t~switch6#1; {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {69065#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} main_#t~short23#1 := main_~y~0#1 < 5; {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} main_#t~short28#1 := main_~z~0#1 < 10; {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,114 INFO L272 TraceCheckUtils]: 38: Hoare triple {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} call main_#t~ret29#1 := rand_end_point(); {69057#true} is VALID [2022-02-20 23:49:14,114 INFO L290 TraceCheckUtils]: 39: Hoare triple {69057#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {69057#true} is VALID [2022-02-20 23:49:14,114 INFO L290 TraceCheckUtils]: 40: Hoare triple {69057#true} assume true; {69057#true} is VALID [2022-02-20 23:49:14,114 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {69057#true} {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} #287#return; {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:14,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {69066#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {69070#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset| 4) (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |ULTIMATE.start_is_empty_~list#1.offset|))} is VALID [2022-02-20 23:49:14,116 INFO L290 TraceCheckUtils]: 43: Hoare triple {69070#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset| 4) (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |ULTIMATE.start_is_empty_~list#1.offset|))} assume !(4 + (is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[is_empty_~list#1.base] && 0 <= is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {69058#false} is VALID [2022-02-20 23:49:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:49:14,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:14,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286551349] [2022-02-20 23:49:14,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286551349] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:14,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477439113] [2022-02-20 23:49:14,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:14,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:14,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:14,118 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:14,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:49:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:14,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:49:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:14,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:14,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {69057#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short21#1 := ~i~0 < 3; {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,704 INFO L290 TraceCheckUtils]: 3: Hoare triple {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,704 INFO L290 TraceCheckUtils]: 4: Hoare triple {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short23#1 := main_~y~0#1 < 5; {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,706 INFO L272 TraceCheckUtils]: 8: Hoare triple {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} call main_#t~ret24#1 := rand_end_point(); {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume true; {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,708 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} #285#return; {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {69075#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} havoc create_item_#t~switch6#1; {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {69112#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {69158#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {69158#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {69158#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {69158#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short23#1 := main_~y~0#1 < 5; {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short28#1 := main_~z~0#1 < 10; {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,722 INFO L272 TraceCheckUtils]: 38: Hoare triple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} call main_#t~ret29#1 := rand_end_point(); {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume true; {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,723 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} #287#return; {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:14,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {69165#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {69205#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| 3) (* ~unnamed1~0~LIST_BEG 4))) (= |ULTIMATE.start_is_empty_~list#1.offset| 0))} is VALID [2022-02-20 23:49:14,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {69205#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| 3) (* ~unnamed1~0~LIST_BEG 4))) (= |ULTIMATE.start_is_empty_~list#1.offset| 0))} assume !(4 + (is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[is_empty_~list#1.base] && 0 <= is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {69058#false} is VALID [2022-02-20 23:49:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:14,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:14,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477439113] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:14,725 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:49:14,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2022-02-20 23:49:14,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383626975] [2022-02-20 23:49:14,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:14,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 23:49:14,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:14,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:14,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:14,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:49:14,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:14,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:49:14,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:49:14,763 INFO L87 Difference]: Start difference. First operand 679 states and 877 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:15,549 INFO L93 Difference]: Finished difference Result 873 states and 1085 transitions. [2022-02-20 23:49:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:15,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 23:49:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 322 transitions. [2022-02-20 23:49:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 322 transitions. [2022-02-20 23:49:15,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 322 transitions. [2022-02-20 23:49:15,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 322 edges. 322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:15,758 INFO L225 Difference]: With dead ends: 873 [2022-02-20 23:49:15,758 INFO L226 Difference]: Without dead ends: 873 [2022-02-20 23:49:15,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:49:15,759 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 480 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:15,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [480 Valid, 451 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:49:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-02-20 23:49:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 676. [2022-02-20 23:49:15,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:15,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 873 states. Second operand has 676 states, 609 states have (on average 1.348111658456486) internal successors, (821), 646 states have internal predecessors, (821), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 23:49:15,767 INFO L74 IsIncluded]: Start isIncluded. First operand 873 states. Second operand has 676 states, 609 states have (on average 1.348111658456486) internal successors, (821), 646 states have internal predecessors, (821), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 23:49:15,767 INFO L87 Difference]: Start difference. First operand 873 states. Second operand has 676 states, 609 states have (on average 1.348111658456486) internal successors, (821), 646 states have internal predecessors, (821), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 23:49:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:15,793 INFO L93 Difference]: Finished difference Result 873 states and 1085 transitions. [2022-02-20 23:49:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1085 transitions. [2022-02-20 23:49:15,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:15,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:15,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 676 states, 609 states have (on average 1.348111658456486) internal successors, (821), 646 states have internal predecessors, (821), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) Second operand 873 states. [2022-02-20 23:49:15,796 INFO L87 Difference]: Start difference. First operand has 676 states, 609 states have (on average 1.348111658456486) internal successors, (821), 646 states have internal predecessors, (821), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) Second operand 873 states. [2022-02-20 23:49:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:15,819 INFO L93 Difference]: Finished difference Result 873 states and 1085 transitions. [2022-02-20 23:49:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1085 transitions. [2022-02-20 23:49:15,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:15,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:15,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:15,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 609 states have (on average 1.348111658456486) internal successors, (821), 646 states have internal predecessors, (821), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 23:49:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 869 transitions. [2022-02-20 23:49:15,834 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 869 transitions. Word has length 44 [2022-02-20 23:49:15,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:15,834 INFO L470 AbstractCegarLoop]: Abstraction has 676 states and 869 transitions. [2022-02-20 23:49:15,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 869 transitions. [2022-02-20 23:49:15,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 23:49:15,835 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:15,835 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:15,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:16,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-02-20 23:49:16,051 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:16,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:16,051 INFO L85 PathProgramCache]: Analyzing trace with hash 990140495, now seen corresponding path program 1 times [2022-02-20 23:49:16,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:16,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914075007] [2022-02-20 23:49:16,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:16,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:16,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:49:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:16,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {72509#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {72509#true} is VALID [2022-02-20 23:49:16,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {72509#true} assume true; {72509#true} is VALID [2022-02-20 23:49:16,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72509#true} {72509#true} #287#return; {72509#true} is VALID [2022-02-20 23:49:16,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 23:49:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:16,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {72509#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {72509#true} is VALID [2022-02-20 23:49:16,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {72509#true} assume true; {72509#true} is VALID [2022-02-20 23:49:16,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72509#true} {72517#(= (select |#valid| |~#list~0.base|) 1)} #287#return; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {72509#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {72509#true} is VALID [2022-02-20 23:49:16,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {72509#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {72509#true} is VALID [2022-02-20 23:49:16,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {72509#true} main_#t~short21#1 := ~i~0 < 3; {72509#true} is VALID [2022-02-20 23:49:16,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {72509#true} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {72509#true} is VALID [2022-02-20 23:49:16,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {72509#true} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {72509#true} is VALID [2022-02-20 23:49:16,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {72509#true} main_#t~short23#1 := main_~y~0#1 < 5; {72509#true} is VALID [2022-02-20 23:49:16,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {72509#true} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {72509#true} is VALID [2022-02-20 23:49:16,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {72509#true} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {72509#true} is VALID [2022-02-20 23:49:16,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {72509#true} main_#t~short28#1 := main_~z~0#1 < 10; {72509#true} is VALID [2022-02-20 23:49:16,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {72509#true} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {72509#true} is VALID [2022-02-20 23:49:16,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {72509#true} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {72509#true} is VALID [2022-02-20 23:49:16,131 INFO L272 TraceCheckUtils]: 11: Hoare triple {72509#true} call main_#t~ret29#1 := rand_end_point(); {72509#true} is VALID [2022-02-20 23:49:16,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {72509#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {72509#true} is VALID [2022-02-20 23:49:16,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {72509#true} assume true; {72509#true} is VALID [2022-02-20 23:49:16,131 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {72509#true} {72509#true} #287#return; {72509#true} is VALID [2022-02-20 23:49:16,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {72509#true} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10); {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_#res#1 := is_empty_~no_beg~0#1; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} remove_one_#t~ret11#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret11#1 && remove_one_#t~ret11#1 <= 2147483647; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume !(0 != remove_one_#t~ret11#1);havoc remove_one_#t~ret11#1; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume remove_one_#t~mem12#1.base == remove_one_#t~mem13#1.base && remove_one_#t~mem12#1.offset == remove_one_#t~mem13#1.offset;havoc remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset;havoc remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L707 {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume 0 == remove_one_#t~mem14#1.offset; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume remove_one_#t~mem14#1.base < #StackHeapBarrier; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume 0 == remove_one_#t~mem14#1.base || 1 == #valid[remove_one_#t~mem14#1.base];call ULTIMATE.dealloc(remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset);havoc remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {72515#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {72515#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {72516#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} is VALID [2022-02-20 23:49:16,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {72516#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr38#1;#Ultimate.C_memset_#t~loopctr38#1 := 0; {72516#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} is VALID [2022-02-20 23:49:16,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {72516#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} assume !(#Ultimate.C_memset_#t~loopctr38#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {72516#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} is VALID [2022-02-20 23:49:16,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {72516#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume { :end_inline_remove_one } true;havoc main_#t~ret29#1;main_#t~post30#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post30#1;havoc main_#t~post30#1; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume !(main_~length~0#1 > 0); {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} main_#t~short28#1 := main_~z~0#1 < 10; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,141 INFO L290 TraceCheckUtils]: 39: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,141 INFO L272 TraceCheckUtils]: 40: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} call main_#t~ret29#1 := rand_end_point(); {72509#true} is VALID [2022-02-20 23:49:16,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {72509#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {72509#true} is VALID [2022-02-20 23:49:16,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {72509#true} assume true; {72509#true} is VALID [2022-02-20 23:49:16,141 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {72509#true} {72517#(= (select |#valid| |~#list~0.base|) 1)} #287#return; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,142 INFO L290 TraceCheckUtils]: 44: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {72521#(= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1)} is VALID [2022-02-20 23:49:16,142 INFO L290 TraceCheckUtils]: 45: Hoare triple {72521#(= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1)} assume !(1 == #valid[is_empty_~list#1.base]); {72510#false} is VALID [2022-02-20 23:49:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:16,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:16,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914075007] [2022-02-20 23:49:16,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914075007] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:16,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253298580] [2022-02-20 23:49:16,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:16,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:16,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:16,144 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:16,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:49:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:16,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:49:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:16,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:16,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {72509#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {72525#(= 3 |~#list~0.base|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {72525#(= 3 |~#list~0.base|)} main_#t~short21#1 := ~i~0 < 3; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,449 INFO L290 TraceCheckUtils]: 3: Hoare triple {72525#(= 3 |~#list~0.base|)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,450 INFO L290 TraceCheckUtils]: 4: Hoare triple {72525#(= 3 |~#list~0.base|)} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {72525#(= 3 |~#list~0.base|)} main_#t~short23#1 := main_~y~0#1 < 5; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {72525#(= 3 |~#list~0.base|)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {72525#(= 3 |~#list~0.base|)} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {72525#(= 3 |~#list~0.base|)} main_#t~short28#1 := main_~z~0#1 < 10; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {72525#(= 3 |~#list~0.base|)} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {72525#(= 3 |~#list~0.base|)} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,452 INFO L272 TraceCheckUtils]: 11: Hoare triple {72525#(= 3 |~#list~0.base|)} call main_#t~ret29#1 := rand_end_point(); {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {72525#(= 3 |~#list~0.base|)} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {72525#(= 3 |~#list~0.base|)} assume true; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,453 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {72525#(= 3 |~#list~0.base|)} {72525#(= 3 |~#list~0.base|)} #287#return; {72525#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:16,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {72525#(= 3 |~#list~0.base|)} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10); {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is_empty_#res#1 := is_empty_~no_beg~0#1; {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} remove_one_#t~ret11#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret11#1 && remove_one_#t~ret11#1 <= 2147483647; {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume !(0 != remove_one_#t~ret11#1);havoc remove_one_#t~ret11#1; {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} SUMMARY for call remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} SUMMARY for call remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume remove_one_#t~mem12#1.base == remove_one_#t~mem13#1.base && remove_one_#t~mem12#1.offset == remove_one_#t~mem13#1.offset;havoc remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset;havoc remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset; {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} SUMMARY for call remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L707 {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume 0 == remove_one_#t~mem14#1.offset; {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume remove_one_#t~mem14#1.base < #StackHeapBarrier; {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {72571#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume 0 == remove_one_#t~mem14#1.base || 1 == #valid[remove_one_#t~mem14#1.base];call ULTIMATE.dealloc(remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset);havoc remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {72617#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {72617#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr38#1;#Ultimate.C_memset_#t~loopctr38#1 := 0; {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume !(#Ultimate.C_memset_#t~loopctr38#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset; {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume { :end_inline_remove_one } true;havoc main_#t~ret29#1;main_#t~post30#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post30#1;havoc main_#t~post30#1; {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume !(main_~length~0#1 > 0); {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} main_#t~short28#1 := main_~z~0#1 < 10; {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,464 INFO L272 TraceCheckUtils]: 40: Hoare triple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} call main_#t~ret29#1 := rand_end_point(); {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume true; {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,466 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} #287#return; {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:16,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {72621#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {72661#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:16,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {72661#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (= (select |#valid| 3) 1))} assume !(1 == #valid[is_empty_~list#1.base]); {72510#false} is VALID [2022-02-20 23:49:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:16,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:16,519 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:49:16,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-02-20 23:49:16,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {72521#(= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1)} assume !(1 == #valid[is_empty_~list#1.base]); {72510#false} is VALID [2022-02-20 23:49:16,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {72521#(= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1)} is VALID [2022-02-20 23:49:16,598 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {72509#true} {72517#(= (select |#valid| |~#list~0.base|) 1)} #287#return; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {72509#true} assume true; {72509#true} is VALID [2022-02-20 23:49:16,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {72509#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {72509#true} is VALID [2022-02-20 23:49:16,599 INFO L272 TraceCheckUtils]: 40: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} call main_#t~ret29#1 := rand_end_point(); {72509#true} is VALID [2022-02-20 23:49:16,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} main_#t~short28#1 := main_~z~0#1 < 10; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume !(main_~length~0#1 > 0); {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume { :end_inline_remove_one } true;havoc main_#t~ret29#1;main_#t~post30#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post30#1;havoc main_#t~post30#1; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr38#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {72517#(= (select |#valid| |~#list~0.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr38#1;#Ultimate.C_memset_#t~loopctr38#1 := 0; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {72515#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {72517#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:16,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume 0 == remove_one_#t~mem14#1.base || 1 == #valid[remove_one_#t~mem14#1.base];call ULTIMATE.dealloc(remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset);havoc remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {72515#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume remove_one_#t~mem14#1.base < #StackHeapBarrier; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume 0 == remove_one_#t~mem14#1.offset; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L707 {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume remove_one_#t~mem12#1.base == remove_one_#t~mem13#1.base && remove_one_#t~mem12#1.offset == remove_one_#t~mem13#1.offset;havoc remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset;havoc remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume !(0 != remove_one_#t~ret11#1);havoc remove_one_#t~ret11#1; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} remove_one_#t~ret11#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret11#1 && remove_one_#t~ret11#1 <= 2147483647; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_#res#1 := is_empty_~no_beg~0#1; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1 || ~i~0 > 10); {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L661 {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L660 {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {72509#true} assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret29#1;havoc remove_one_#t~ret11#1, remove_one_#t~mem12#1.base, remove_one_#t~mem12#1.offset, remove_one_#t~mem13#1.base, remove_one_#t~mem13#1.offset, remove_one_#t~mem14#1.base, remove_one_#t~mem14#1.offset, remove_one_#t~memset~res15#1.base, remove_one_#t~memset~res15#1.offset, remove_one_#t~ite16#1, remove_one_#t~ite17#1, remove_one_#t~mem18#1.base, remove_one_#t~mem18#1.offset, remove_one_#t~mem19#1.base, remove_one_#t~mem19#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {72514#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:16,609 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {72509#true} {72509#true} #287#return; {72509#true} is VALID [2022-02-20 23:49:16,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {72509#true} assume true; {72509#true} is VALID [2022-02-20 23:49:16,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {72509#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {72509#true} is VALID [2022-02-20 23:49:16,609 INFO L272 TraceCheckUtils]: 11: Hoare triple {72509#true} call main_#t~ret29#1 := rand_end_point(); {72509#true} is VALID [2022-02-20 23:49:16,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {72509#true} assume !!main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {72509#true} is VALID [2022-02-20 23:49:16,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {72509#true} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {72509#true} is VALID [2022-02-20 23:49:16,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {72509#true} main_#t~short28#1 := main_~z~0#1 < 10; {72509#true} is VALID [2022-02-20 23:49:16,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {72509#true} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {72509#true} is VALID [2022-02-20 23:49:16,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {72509#true} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {72509#true} is VALID [2022-02-20 23:49:16,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {72509#true} main_#t~short23#1 := main_~y~0#1 < 5; {72509#true} is VALID [2022-02-20 23:49:16,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {72509#true} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {72509#true} is VALID [2022-02-20 23:49:16,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {72509#true} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {72509#true} is VALID [2022-02-20 23:49:16,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {72509#true} main_#t~short21#1 := ~i~0 < 3; {72509#true} is VALID [2022-02-20 23:49:16,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {72509#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {72509#true} is VALID [2022-02-20 23:49:16,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {72509#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {72509#true} is VALID [2022-02-20 23:49:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:16,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253298580] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:16,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:16,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-02-20 23:49:16,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338095992] [2022-02-20 23:49:16,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:16,612 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-02-20 23:49:16,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:16,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:16,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:16,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:49:16,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:16,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:49:16,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:49:16,692 INFO L87 Difference]: Start difference. First operand 676 states and 869 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:18,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:18,894 INFO L93 Difference]: Finished difference Result 2164 states and 2713 transitions. [2022-02-20 23:49:18,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:49:18,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-02-20 23:49:18,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 921 transitions. [2022-02-20 23:49:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 921 transitions. [2022-02-20 23:49:18,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 921 transitions. [2022-02-20 23:49:19,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 921 edges. 921 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:19,639 INFO L225 Difference]: With dead ends: 2164 [2022-02-20 23:49:19,639 INFO L226 Difference]: Without dead ends: 2164 [2022-02-20 23:49:19,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:49:19,641 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 1641 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:19,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1643 Valid, 1091 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:49:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2022-02-20 23:49:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 831. [2022-02-20 23:49:19,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:19,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2164 states. Second operand has 831 states, 758 states have (on average 1.3007915567282322) internal successors, (986), 791 states have internal predecessors, (986), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 27 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 23:49:19,684 INFO L74 IsIncluded]: Start isIncluded. First operand 2164 states. Second operand has 831 states, 758 states have (on average 1.3007915567282322) internal successors, (986), 791 states have internal predecessors, (986), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 27 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 23:49:19,684 INFO L87 Difference]: Start difference. First operand 2164 states. Second operand has 831 states, 758 states have (on average 1.3007915567282322) internal successors, (986), 791 states have internal predecessors, (986), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 27 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 23:49:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:19,925 INFO L93 Difference]: Finished difference Result 2164 states and 2713 transitions. [2022-02-20 23:49:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2713 transitions. [2022-02-20 23:49:19,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:19,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:19,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 831 states, 758 states have (on average 1.3007915567282322) internal successors, (986), 791 states have internal predecessors, (986), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 27 states have call predecessors, (33), 33 states have call successors, (33) Second operand 2164 states. [2022-02-20 23:49:19,928 INFO L87 Difference]: Start difference. First operand has 831 states, 758 states have (on average 1.3007915567282322) internal successors, (986), 791 states have internal predecessors, (986), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 27 states have call predecessors, (33), 33 states have call successors, (33) Second operand 2164 states. [2022-02-20 23:49:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:20,050 INFO L93 Difference]: Finished difference Result 2164 states and 2713 transitions. [2022-02-20 23:49:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2713 transitions. [2022-02-20 23:49:20,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:20,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:20,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:20,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 758 states have (on average 1.3007915567282322) internal successors, (986), 791 states have internal predecessors, (986), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 27 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 23:49:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1052 transitions. [2022-02-20 23:49:20,074 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1052 transitions. Word has length 46 [2022-02-20 23:49:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:20,074 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1052 transitions. [2022-02-20 23:49:20,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1052 transitions. [2022-02-20 23:49:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 23:49:20,075 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:20,075 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:20,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:20,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-02-20 23:49:20,292 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash -201066803, now seen corresponding path program 1 times [2022-02-20 23:49:20,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:20,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687949434] [2022-02-20 23:49:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:20,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:20,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {80146#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {80146#true} is VALID [2022-02-20 23:49:20,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {80146#true} assume true; {80146#true} is VALID [2022-02-20 23:49:20,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80146#true} {80148#(= ~i~0 0)} #285#return; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {80146#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {80148#(= ~i~0 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {80148#(= ~i~0 0)} main_#t~short21#1 := ~i~0 < 3; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {80148#(= ~i~0 0)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,339 INFO L290 TraceCheckUtils]: 4: Hoare triple {80148#(= ~i~0 0)} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {80148#(= ~i~0 0)} main_#t~short23#1 := main_~y~0#1 < 5; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {80148#(= ~i~0 0)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {80148#(= ~i~0 0)} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,340 INFO L272 TraceCheckUtils]: 8: Hoare triple {80148#(= ~i~0 0)} call main_#t~ret24#1 := rand_end_point(); {80146#true} is VALID [2022-02-20 23:49:20,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {80146#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {80146#true} is VALID [2022-02-20 23:49:20,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {80146#true} assume true; {80146#true} is VALID [2022-02-20 23:49:20,341 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {80146#true} {80148#(= ~i~0 0)} #285#return; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {80148#(= ~i~0 0)} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {80148#(= ~i~0 0)} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {80148#(= ~i~0 0)} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {80148#(= ~i~0 0)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {80148#(= ~i~0 0)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {80148#(= ~i~0 0)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {80148#(= ~i~0 0)} havoc create_item_#t~switch6#1; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {80148#(= ~i~0 0)} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {80148#(= ~i~0 0)} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {80148#(= ~i~0 0)} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {80148#(= ~i~0 0)} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {80148#(= ~i~0 0)} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {80148#(= ~i~0 0)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {80148#(= ~i~0 0)} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {80148#(= ~i~0 0)} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {80148#(= ~i~0 0)} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {80148#(= ~i~0 0)} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {80148#(= ~i~0 0)} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {80148#(= ~i~0 0)} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {80148#(= ~i~0 0)} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {80148#(= ~i~0 0)} main_#t~short23#1 := main_~y~0#1 < 5; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {80148#(= ~i~0 0)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {80148#(= ~i~0 0)} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {80148#(= ~i~0 0)} main_#t~short28#1 := main_~z~0#1 < 10; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {80148#(= ~i~0 0)} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {80148#(= ~i~0 0)} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {80148#(= ~i~0 0)} is VALID [2022-02-20 23:49:20,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {80148#(= ~i~0 0)} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {80152#(<= ~i~0 1)} main_#t~short21#1 := ~i~0 < 3; {80153#|ULTIMATE.start_main_#t~short21#1|} is VALID [2022-02-20 23:49:20,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {80153#|ULTIMATE.start_main_#t~short21#1|} assume !main_#t~short21#1; {80147#false} is VALID [2022-02-20 23:49:20,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {80147#false} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {80147#false} is VALID [2022-02-20 23:49:20,360 INFO L290 TraceCheckUtils]: 42: Hoare triple {80147#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {80147#false} is VALID [2022-02-20 23:49:20,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {80147#false} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {80147#false} is VALID [2022-02-20 23:49:20,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {80147#false} assume !(4 + (~#list~0.offset + 4 * main_~end_point~0#1) <= #length[~#list~0.base] && 0 <= ~#list~0.offset + 4 * main_~end_point~0#1); {80147#false} is VALID [2022-02-20 23:49:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:20,361 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:20,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687949434] [2022-02-20 23:49:20,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687949434] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:20,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194573721] [2022-02-20 23:49:20,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:20,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:20,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:20,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:20,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:49:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:20,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:20,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:20,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {80146#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {80157#(<= ~i~0 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {80157#(<= ~i~0 0)} main_#t~short21#1 := ~i~0 < 3; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,665 INFO L290 TraceCheckUtils]: 3: Hoare triple {80157#(<= ~i~0 0)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {80157#(<= ~i~0 0)} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {80157#(<= ~i~0 0)} main_#t~short23#1 := main_~y~0#1 < 5; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {80157#(<= ~i~0 0)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {80157#(<= ~i~0 0)} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,666 INFO L272 TraceCheckUtils]: 8: Hoare triple {80157#(<= ~i~0 0)} call main_#t~ret24#1 := rand_end_point(); {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {80157#(<= ~i~0 0)} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {80157#(<= ~i~0 0)} assume true; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,668 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {80157#(<= ~i~0 0)} {80157#(<= ~i~0 0)} #285#return; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {80157#(<= ~i~0 0)} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {80157#(<= ~i~0 0)} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {80157#(<= ~i~0 0)} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {80157#(<= ~i~0 0)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {80157#(<= ~i~0 0)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {80157#(<= ~i~0 0)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {80157#(<= ~i~0 0)} havoc create_item_#t~switch6#1; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {80157#(<= ~i~0 0)} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {80157#(<= ~i~0 0)} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {80157#(<= ~i~0 0)} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {80157#(<= ~i~0 0)} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {80157#(<= ~i~0 0)} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {80157#(<= ~i~0 0)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {80157#(<= ~i~0 0)} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {80157#(<= ~i~0 0)} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {80157#(<= ~i~0 0)} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {80157#(<= ~i~0 0)} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {80157#(<= ~i~0 0)} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {80157#(<= ~i~0 0)} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {80157#(<= ~i~0 0)} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {80157#(<= ~i~0 0)} main_#t~short23#1 := main_~y~0#1 < 5; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {80157#(<= ~i~0 0)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {80157#(<= ~i~0 0)} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {80157#(<= ~i~0 0)} main_#t~short28#1 := main_~z~0#1 < 10; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {80157#(<= ~i~0 0)} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {80157#(<= ~i~0 0)} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {80157#(<= ~i~0 0)} is VALID [2022-02-20 23:49:20,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {80157#(<= ~i~0 0)} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {80152#(<= ~i~0 1)} main_#t~short21#1 := ~i~0 < 3; {80153#|ULTIMATE.start_main_#t~short21#1|} is VALID [2022-02-20 23:49:20,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {80153#|ULTIMATE.start_main_#t~short21#1|} assume !main_#t~short21#1; {80147#false} is VALID [2022-02-20 23:49:20,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {80147#false} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {80147#false} is VALID [2022-02-20 23:49:20,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {80147#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {80147#false} is VALID [2022-02-20 23:49:20,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {80147#false} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {80147#false} is VALID [2022-02-20 23:49:20,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {80147#false} assume !(4 + (~#list~0.offset + 4 * main_~end_point~0#1) <= #length[~#list~0.base] && 0 <= ~#list~0.offset + 4 * main_~end_point~0#1); {80147#false} is VALID [2022-02-20 23:49:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:20,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:20,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {80147#false} assume !(4 + (~#list~0.offset + 4 * main_~end_point~0#1) <= #length[~#list~0.base] && 0 <= ~#list~0.offset + 4 * main_~end_point~0#1); {80147#false} is VALID [2022-02-20 23:49:20,845 INFO L290 TraceCheckUtils]: 43: Hoare triple {80147#false} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {80147#false} is VALID [2022-02-20 23:49:20,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {80147#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {80147#false} is VALID [2022-02-20 23:49:20,846 INFO L290 TraceCheckUtils]: 41: Hoare triple {80147#false} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {80147#false} is VALID [2022-02-20 23:49:20,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {80153#|ULTIMATE.start_main_#t~short21#1|} assume !main_#t~short21#1; {80147#false} is VALID [2022-02-20 23:49:20,846 INFO L290 TraceCheckUtils]: 39: Hoare triple {80305#(< ~i~0 3)} main_#t~short21#1 := ~i~0 < 3; {80153#|ULTIMATE.start_main_#t~short21#1|} is VALID [2022-02-20 23:49:20,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {80152#(<= ~i~0 1)} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {80305#(< ~i~0 3)} is VALID [2022-02-20 23:49:20,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {80152#(<= ~i~0 1)} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {80152#(<= ~i~0 1)} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {80152#(<= ~i~0 1)} main_#t~short28#1 := main_~z~0#1 < 10; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {80152#(<= ~i~0 1)} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {80152#(<= ~i~0 1)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {80152#(<= ~i~0 1)} main_#t~short23#1 := main_~y~0#1 < 5; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {80152#(<= ~i~0 1)} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {80152#(<= ~i~0 1)} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {80152#(<= ~i~0 1)} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {80152#(<= ~i~0 1)} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {80152#(<= ~i~0 1)} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {80152#(<= ~i~0 1)} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {80152#(<= ~i~0 1)} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {80152#(<= ~i~0 1)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {80152#(<= ~i~0 1)} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {80152#(<= ~i~0 1)} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {80152#(<= ~i~0 1)} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {80152#(<= ~i~0 1)} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {80152#(<= ~i~0 1)} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {80152#(<= ~i~0 1)} havoc create_item_#t~switch6#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {80152#(<= ~i~0 1)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {80152#(<= ~i~0 1)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {80152#(<= ~i~0 1)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {80152#(<= ~i~0 1)} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {80152#(<= ~i~0 1)} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {80152#(<= ~i~0 1)} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,855 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {80146#true} {80152#(<= ~i~0 1)} #285#return; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {80146#true} assume true; {80146#true} is VALID [2022-02-20 23:49:20,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {80146#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {80146#true} is VALID [2022-02-20 23:49:20,855 INFO L272 TraceCheckUtils]: 8: Hoare triple {80152#(<= ~i~0 1)} call main_#t~ret24#1 := rand_end_point(); {80146#true} is VALID [2022-02-20 23:49:20,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {80152#(<= ~i~0 1)} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {80152#(<= ~i~0 1)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {80152#(<= ~i~0 1)} main_#t~short23#1 := main_~y~0#1 < 5; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {80152#(<= ~i~0 1)} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {80152#(<= ~i~0 1)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {80152#(<= ~i~0 1)} main_#t~short21#1 := ~i~0 < 3; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {80152#(<= ~i~0 1)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {80146#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {80152#(<= ~i~0 1)} is VALID [2022-02-20 23:49:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:20,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194573721] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:20,859 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:20,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 7 [2022-02-20 23:49:20,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429907757] [2022-02-20 23:49:20,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:20,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2022-02-20 23:49:20,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:20,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:20,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:20,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:49:20,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:20,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:49:20,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:49:20,949 INFO L87 Difference]: Start difference. First operand 831 states and 1052 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:21,676 INFO L93 Difference]: Finished difference Result 2728 states and 3437 transitions. [2022-02-20 23:49:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:49:21,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2022-02-20 23:49:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 506 transitions. [2022-02-20 23:49:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 506 transitions. [2022-02-20 23:49:21,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 506 transitions. [2022-02-20 23:49:21,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 506 edges. 506 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:22,136 INFO L225 Difference]: With dead ends: 2728 [2022-02-20 23:49:22,137 INFO L226 Difference]: Without dead ends: 2728 [2022-02-20 23:49:22,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:49:22,137 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 605 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:22,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [605 Valid, 754 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2022-02-20 23:49:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 1906. [2022-02-20 23:49:22,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:22,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2728 states. Second operand has 1906 states, 1774 states have (on average 1.2953776775648254) internal successors, (2298), 1811 states have internal predecessors, (2298), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-02-20 23:49:22,164 INFO L74 IsIncluded]: Start isIncluded. First operand 2728 states. Second operand has 1906 states, 1774 states have (on average 1.2953776775648254) internal successors, (2298), 1811 states have internal predecessors, (2298), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-02-20 23:49:22,165 INFO L87 Difference]: Start difference. First operand 2728 states. Second operand has 1906 states, 1774 states have (on average 1.2953776775648254) internal successors, (2298), 1811 states have internal predecessors, (2298), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-02-20 23:49:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:22,382 INFO L93 Difference]: Finished difference Result 2728 states and 3437 transitions. [2022-02-20 23:49:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 3437 transitions. [2022-02-20 23:49:22,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:22,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:22,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 1906 states, 1774 states have (on average 1.2953776775648254) internal successors, (2298), 1811 states have internal predecessors, (2298), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) Second operand 2728 states. [2022-02-20 23:49:22,391 INFO L87 Difference]: Start difference. First operand has 1906 states, 1774 states have (on average 1.2953776775648254) internal successors, (2298), 1811 states have internal predecessors, (2298), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) Second operand 2728 states. [2022-02-20 23:49:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:22,599 INFO L93 Difference]: Finished difference Result 2728 states and 3437 transitions. [2022-02-20 23:49:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 3437 transitions. [2022-02-20 23:49:22,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:22,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:22,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:22,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1774 states have (on average 1.2953776775648254) internal successors, (2298), 1811 states have internal predecessors, (2298), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-02-20 23:49:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2446 transitions. [2022-02-20 23:49:22,718 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2446 transitions. Word has length 45 [2022-02-20 23:49:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:22,719 INFO L470 AbstractCegarLoop]: Abstraction has 1906 states and 2446 transitions. [2022-02-20 23:49:22,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2446 transitions. [2022-02-20 23:49:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 23:49:22,720 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:22,720 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:22,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:22,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-02-20 23:49:22,938 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:22,939 INFO L85 PathProgramCache]: Analyzing trace with hash -202913845, now seen corresponding path program 1 times [2022-02-20 23:49:22,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:22,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568336043] [2022-02-20 23:49:22,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:23,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:23,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {90518#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {90533#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:23,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {90533#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {90533#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:23,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90533#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #285#return; {90524#(and (<= (+ |~#list~0.offset| (* 8 |ULTIMATE.start_main_#t~ret24#1|)) (* ~unnamed1~0~LIST_BEG 8)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)))} is VALID [2022-02-20 23:49:23,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {90518#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:23,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:23,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short21#1 := ~i~0 < 3; {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:23,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:23,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:23,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short23#1 := main_~y~0#1 < 5; {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:23,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:23,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:23,283 INFO L272 TraceCheckUtils]: 8: Hoare triple {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret24#1 := rand_end_point(); {90518#true} is VALID [2022-02-20 23:49:23,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {90518#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {90533#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:23,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {90533#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {90533#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:23,284 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {90533#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {90520#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #285#return; {90524#(and (<= (+ |~#list~0.offset| (* 8 |ULTIMATE.start_main_#t~ret24#1|)) (* ~unnamed1~0~LIST_BEG 8)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)))} is VALID [2022-02-20 23:49:23,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {90524#(and (<= (+ |~#list~0.offset| (* 8 |ULTIMATE.start_main_#t~ret24#1|)) (* ~unnamed1~0~LIST_BEG 8)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|)))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {90525#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* 8 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 8)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)))} is VALID [2022-02-20 23:49:23,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {90525#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* 8 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 8)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {90526#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {90526#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {90527#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {90527#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {90527#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {90527#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {90528#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (or (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (not |ULTIMATE.start_create_item_#t~switch6#1|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {90528#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (or (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (not |ULTIMATE.start_create_item_#t~switch6#1|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} havoc create_item_#t~switch6#1; {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} is VALID [2022-02-20 23:49:23,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {90529#(and (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_append_one_~to#1|) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|)) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (+ (* ~unnamed1~0~LIST_BEG 8) |ULTIMATE.start_append_one_~list#1.offset|)))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {90530#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {90530#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {90530#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {90530#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {90530#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {90530#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} main_#t~short23#1 := main_~y~0#1 < 5; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} main_#t~short28#1 := main_~z~0#1 < 10; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} main_#t~short21#1 := ~i~0 < 3; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:23,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {90531#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {90532#(and (<= (+ (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset| 4) (+ (* ~unnamed1~0~LIST_BEG 8) (select |#length| |~#list~0.base|))) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)))} is VALID [2022-02-20 23:49:23,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {90532#(and (<= (+ (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset| 4) (+ (* ~unnamed1~0~LIST_BEG 8) (select |#length| |~#list~0.base|))) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)))} assume !(4 + (~#list~0.offset + 4 * main_~end_point~0#1) <= #length[~#list~0.base] && 0 <= ~#list~0.offset + 4 * main_~end_point~0#1); {90519#false} is VALID [2022-02-20 23:49:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:23,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:23,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568336043] [2022-02-20 23:49:23,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568336043] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:23,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010724974] [2022-02-20 23:49:23,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:23,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:23,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:23,312 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:23,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:49:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:23,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:49:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:23,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:23,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {90518#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short21#1 := ~i~0 < 3; {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short23#1 := main_~y~0#1 < 5; {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,831 INFO L272 TraceCheckUtils]: 8: Hoare triple {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} call main_#t~ret24#1 := rand_end_point(); {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume true; {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,832 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} #285#return; {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {90537#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} havoc create_item_#t~switch6#1; {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {90574#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {90620#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {90620#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {90620#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {90620#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short23#1 := main_~y~0#1 < 5; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short28#1 := main_~z~0#1 < 10; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short21#1 := ~i~0 < 3; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:23,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {90627#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {90670#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_~end_point~0#1|))} is VALID [2022-02-20 23:49:23,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {90670#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_~end_point~0#1|))} assume !(4 + (~#list~0.offset + 4 * main_~end_point~0#1) <= #length[~#list~0.base] && 0 <= ~#list~0.offset + 4 * main_~end_point~0#1); {90519#false} is VALID [2022-02-20 23:49:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:23,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:23,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010724974] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:23,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:49:23,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 17 [2022-02-20 23:49:23,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807042694] [2022-02-20 23:49:23,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:23,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-02-20 23:49:23,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:23,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:23,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:23,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:49:23,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:23,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:49:23,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:49:23,879 INFO L87 Difference]: Start difference. First operand 1906 states and 2446 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:24,581 INFO L93 Difference]: Finished difference Result 1954 states and 2477 transitions. [2022-02-20 23:49:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:24,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-02-20 23:49:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2022-02-20 23:49:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2022-02-20 23:49:24,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 243 transitions. [2022-02-20 23:49:24,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:24,885 INFO L225 Difference]: With dead ends: 1954 [2022-02-20 23:49:24,885 INFO L226 Difference]: Without dead ends: 1954 [2022-02-20 23:49:24,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:49:24,886 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 568 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:24,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 371 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2022-02-20 23:49:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1908. [2022-02-20 23:49:24,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:24,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1954 states. Second operand has 1908 states, 1776 states have (on average 1.2956081081081081) internal successors, (2301), 1813 states have internal predecessors, (2301), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-02-20 23:49:24,903 INFO L74 IsIncluded]: Start isIncluded. First operand 1954 states. Second operand has 1908 states, 1776 states have (on average 1.2956081081081081) internal successors, (2301), 1813 states have internal predecessors, (2301), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-02-20 23:49:24,904 INFO L87 Difference]: Start difference. First operand 1954 states. Second operand has 1908 states, 1776 states have (on average 1.2956081081081081) internal successors, (2301), 1813 states have internal predecessors, (2301), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-02-20 23:49:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:25,005 INFO L93 Difference]: Finished difference Result 1954 states and 2477 transitions. [2022-02-20 23:49:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2477 transitions. [2022-02-20 23:49:25,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:25,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:25,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 1908 states, 1776 states have (on average 1.2956081081081081) internal successors, (2301), 1813 states have internal predecessors, (2301), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) Second operand 1954 states. [2022-02-20 23:49:25,009 INFO L87 Difference]: Start difference. First operand has 1908 states, 1776 states have (on average 1.2956081081081081) internal successors, (2301), 1813 states have internal predecessors, (2301), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) Second operand 1954 states. [2022-02-20 23:49:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:25,118 INFO L93 Difference]: Finished difference Result 1954 states and 2477 transitions. [2022-02-20 23:49:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2477 transitions. [2022-02-20 23:49:25,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:25,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:25,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:25,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1776 states have (on average 1.2956081081081081) internal successors, (2301), 1813 states have internal predecessors, (2301), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-02-20 23:49:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2449 transitions. [2022-02-20 23:49:25,222 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2449 transitions. Word has length 45 [2022-02-20 23:49:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:25,222 INFO L470 AbstractCegarLoop]: Abstraction has 1908 states and 2449 transitions. [2022-02-20 23:49:25,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2449 transitions. [2022-02-20 23:49:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 23:49:25,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:25,223 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:25,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:25,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:25,440 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:25,440 INFO L85 PathProgramCache]: Analyzing trace with hash -202913783, now seen corresponding path program 1 times [2022-02-20 23:49:25,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:25,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387202952] [2022-02-20 23:49:25,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:25,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:25,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:25,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {98447#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {98459#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:49:25,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {98459#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {98459#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:49:25,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98459#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #285#return; {98453#(and (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {98447#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:25,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:25,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short21#1 := ~i~0 < 3; {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:25,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:25,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:25,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short23#1 := main_~y~0#1 < 5; {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:25,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:25,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:25,600 INFO L272 TraceCheckUtils]: 8: Hoare triple {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret24#1 := rand_end_point(); {98447#true} is VALID [2022-02-20 23:49:25,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {98447#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {98459#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:49:25,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {98459#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {98459#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:49:25,601 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {98459#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {98449#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #285#return; {98453#(and (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {98453#(and (<= (+ (* 4 |ULTIMATE.start_main_#t~ret24#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (<= 0 |~#list~0.offset|))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {98454#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {98454#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {98455#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {98455#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} havoc create_item_#t~switch6#1; {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {98456#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |~#list~0.offset| (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} main_#t~short23#1 := main_~y~0#1 < 5; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} main_#t~short28#1 := main_~z~0#1 < 10; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} main_#t~short21#1 := ~i~0 < 3; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:25,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {98457#(and (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= 0 |~#list~0.offset|))} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {98458#(and (<= (* ~unnamed1~0~LIST_END 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:25,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {98458#(and (<= (* ~unnamed1~0~LIST_END 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))))} assume !(4 + (~#list~0.offset + 4 * main_~end_point~0#1) <= #length[~#list~0.base] && 0 <= ~#list~0.offset + 4 * main_~end_point~0#1); {98448#false} is VALID [2022-02-20 23:49:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:25,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:25,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387202952] [2022-02-20 23:49:25,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387202952] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:25,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268317189] [2022-02-20 23:49:25,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:25,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:25,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:25,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:25,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 23:49:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:25,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:49:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:25,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:26,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {98447#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short21#1 := ~i~0 < 3; {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short23#1 := main_~y~0#1 < 5; {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,081 INFO L272 TraceCheckUtils]: 8: Hoare triple {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} call main_#t~ret24#1 := rand_end_point(); {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume true; {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,082 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} #285#return; {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {98463#(and (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} havoc create_item_#t~switch6#1; {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {98500#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {98546#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {98546#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {98546#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {98546#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |~#list~0.base|))} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short23#1 := main_~y~0#1 < 5; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short28#1 := main_~z~0#1 < 10; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} main_#t~short21#1 := ~i~0 < 3; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,095 INFO L290 TraceCheckUtils]: 42: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:26,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {98553#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|))} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {98596#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= ~unnamed1~0~LIST_END |ULTIMATE.start_main_~end_point~0#1|))} is VALID [2022-02-20 23:49:26,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {98596#(and (<= (+ (* ~unnamed1~0~LIST_END 4) 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= ~unnamed1~0~LIST_END |ULTIMATE.start_main_~end_point~0#1|))} assume !(4 + (~#list~0.offset + 4 * main_~end_point~0#1) <= #length[~#list~0.base] && 0 <= ~#list~0.offset + 4 * main_~end_point~0#1); {98448#false} is VALID [2022-02-20 23:49:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:26,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:26,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268317189] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:26,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:49:26,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2022-02-20 23:49:26,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907100380] [2022-02-20 23:49:26,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:26,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-02-20 23:49:26,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:26,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:26,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:26,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:49:26,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:26,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:49:26,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:49:26,124 INFO L87 Difference]: Start difference. First operand 1908 states and 2449 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:26,682 INFO L93 Difference]: Finished difference Result 1953 states and 2475 transitions. [2022-02-20 23:49:26,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:26,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-02-20 23:49:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 242 transitions. [2022-02-20 23:49:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 242 transitions. [2022-02-20 23:49:26,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 242 transitions. [2022-02-20 23:49:26,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:26,932 INFO L225 Difference]: With dead ends: 1953 [2022-02-20 23:49:26,932 INFO L226 Difference]: Without dead ends: 1953 [2022-02-20 23:49:26,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:49:26,933 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 508 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:26,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 388 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2022-02-20 23:49:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1905. [2022-02-20 23:49:26,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:26,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1953 states. Second operand has 1905 states, 1774 states have (on average 1.294250281848929) internal successors, (2296), 1810 states have internal predecessors, (2296), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-02-20 23:49:26,952 INFO L74 IsIncluded]: Start isIncluded. First operand 1953 states. Second operand has 1905 states, 1774 states have (on average 1.294250281848929) internal successors, (2296), 1810 states have internal predecessors, (2296), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-02-20 23:49:26,953 INFO L87 Difference]: Start difference. First operand 1953 states. Second operand has 1905 states, 1774 states have (on average 1.294250281848929) internal successors, (2296), 1810 states have internal predecessors, (2296), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-02-20 23:49:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:27,047 INFO L93 Difference]: Finished difference Result 1953 states and 2475 transitions. [2022-02-20 23:49:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2475 transitions. [2022-02-20 23:49:27,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:27,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:27,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 1905 states, 1774 states have (on average 1.294250281848929) internal successors, (2296), 1810 states have internal predecessors, (2296), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) Second operand 1953 states. [2022-02-20 23:49:27,052 INFO L87 Difference]: Start difference. First operand has 1905 states, 1774 states have (on average 1.294250281848929) internal successors, (2296), 1810 states have internal predecessors, (2296), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) Second operand 1953 states. [2022-02-20 23:49:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:27,155 INFO L93 Difference]: Finished difference Result 1953 states and 2475 transitions. [2022-02-20 23:49:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2475 transitions. [2022-02-20 23:49:27,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:27,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:27,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:27,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:27,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1774 states have (on average 1.294250281848929) internal successors, (2296), 1810 states have internal predecessors, (2296), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-02-20 23:49:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2444 transitions. [2022-02-20 23:49:27,257 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2444 transitions. Word has length 45 [2022-02-20 23:49:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:27,258 INFO L470 AbstractCegarLoop]: Abstraction has 1905 states and 2444 transitions. [2022-02-20 23:49:27,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2444 transitions. [2022-02-20 23:49:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 23:49:27,259 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:27,259 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:27,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:27,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-02-20 23:49:27,460 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1987177000, now seen corresponding path program 1 times [2022-02-20 23:49:27,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:27,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581029969] [2022-02-20 23:49:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:27,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:27,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {106367#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {106367#true} is VALID [2022-02-20 23:49:27,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {106367#true} assume true; {106367#true} is VALID [2022-02-20 23:49:27,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {106367#true} {106369#(= |~#list~0.offset| 0)} #285#return; {106369#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:27,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {106367#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {106369#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:27,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {106369#(= |~#list~0.offset| 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {106369#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:27,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {106369#(= |~#list~0.offset| 0)} main_#t~short21#1 := ~i~0 < 3; {106369#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:27,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {106369#(= |~#list~0.offset| 0)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {106369#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:27,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {106369#(= |~#list~0.offset| 0)} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {106369#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:27,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {106369#(= |~#list~0.offset| 0)} main_#t~short23#1 := main_~y~0#1 < 5; {106369#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:27,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {106369#(= |~#list~0.offset| 0)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {106369#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:27,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {106369#(= |~#list~0.offset| 0)} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {106369#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:27,844 INFO L272 TraceCheckUtils]: 8: Hoare triple {106369#(= |~#list~0.offset| 0)} call main_#t~ret24#1 := rand_end_point(); {106367#true} is VALID [2022-02-20 23:49:27,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {106367#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {106367#true} is VALID [2022-02-20 23:49:27,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {106367#true} assume true; {106367#true} is VALID [2022-02-20 23:49:27,845 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {106367#true} {106369#(= |~#list~0.offset| 0)} #285#return; {106369#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:27,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {106369#(= |~#list~0.offset| 0)} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {106373#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (not (= 0 |ULTIMATE.start_append_one_~to#1|))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {106373#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (not (= 0 |ULTIMATE.start_append_one_~to#1|))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {106373#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (not (= 0 |ULTIMATE.start_append_one_~to#1|))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {106373#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (not (= 0 |ULTIMATE.start_append_one_~to#1|))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {106374#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (not (= 0 |ULTIMATE.start_append_one_~to#1|))) (or (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {106374#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (not (= 0 |ULTIMATE.start_append_one_~to#1|))) (or (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {106374#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (not (= 0 |ULTIMATE.start_append_one_~to#1|))) (or (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {106374#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (not (= 0 |ULTIMATE.start_append_one_~to#1|))) (or (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {106375#(and (or (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= 0 |ULTIMATE.start_append_one_~to#1|)) (not |ULTIMATE.start_create_item_#t~switch6#1|)) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {106375#(and (or (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= 0 |ULTIMATE.start_append_one_~to#1|)) (not |ULTIMATE.start_create_item_#t~switch6#1|)) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {106376#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {106376#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_#t~switch6#1; {106376#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {106376#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {106377#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {106377#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {106377#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {106377#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {106377#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {106377#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {106378#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {106378#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {106378#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {106378#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {106379#(and (= (select |#valid| |ULTIMATE.start_create_item_#res#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {106379#(and (= (select |#valid| |ULTIMATE.start_create_item_#res#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {106380#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {106380#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {106381#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {106381#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {106381#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {106381#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {106381#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:27,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {106381#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} main_#t~short23#1 := main_~y~0#1 < 5; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} main_#t~short28#1 := main_~z~0#1 < 10; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} main_#t~short21#1 := ~i~0 < 3; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} is VALID [2022-02-20 23:49:27,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {106382#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1))} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {106383#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_main_~end_point~0#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) 1))} is VALID [2022-02-20 23:49:27,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {106383#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_main_~end_point~0#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) 1))} SUMMARY for call main_#t~mem34#1.base, main_#t~mem34#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L751-2 {106384#(= (select |#valid| |ULTIMATE.start_main_#t~mem34#1.base|) 1)} is VALID [2022-02-20 23:49:27,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {106384#(= (select |#valid| |ULTIMATE.start_main_#t~mem34#1.base|) 1)} main_~cursor~0#1.base, main_~cursor~0#1.offset := main_#t~mem34#1.base, main_#t~mem34#1.offset;havoc main_#t~mem34#1.base, main_#t~mem34#1.offset; {106385#(= (select |#valid| |ULTIMATE.start_main_~cursor~0#1.base|) 1)} is VALID [2022-02-20 23:49:27,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {106385#(= (select |#valid| |ULTIMATE.start_main_~cursor~0#1.base|) 1)} assume !!(main_~length~0#1 > 0); {106385#(= (select |#valid| |ULTIMATE.start_main_~cursor~0#1.base|) 1)} is VALID [2022-02-20 23:49:27,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {106385#(= (select |#valid| |ULTIMATE.start_main_~cursor~0#1.base|) 1)} assume !(1 == #valid[main_~cursor~0#1.base]); {106368#false} is VALID [2022-02-20 23:49:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:27,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:27,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581029969] [2022-02-20 23:49:27,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581029969] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:27,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:27,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 23:49:27,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094201732] [2022-02-20 23:49:27,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:27,865 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-02-20 23:49:27,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:27,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:27,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:27,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:49:27,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:27,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:49:27,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:49:27,908 INFO L87 Difference]: Start difference. First operand 1905 states and 2444 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,244 INFO L93 Difference]: Finished difference Result 2115 states and 2684 transitions. [2022-02-20 23:49:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 23:49:30,244 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-02-20 23:49:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 336 transitions. [2022-02-20 23:49:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 336 transitions. [2022-02-20 23:49:30,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 336 transitions. [2022-02-20 23:49:30,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:30,628 INFO L225 Difference]: With dead ends: 2115 [2022-02-20 23:49:30,629 INFO L226 Difference]: Without dead ends: 2115 [2022-02-20 23:49:30,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2022-02-20 23:49:30,629 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 846 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:30,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [848 Valid, 1281 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:49:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2022-02-20 23:49:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1965. [2022-02-20 23:49:30,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:30,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2115 states. Second operand has 1965 states, 1827 states have (on average 1.2939244663382594) internal successors, (2364), 1864 states have internal predecessors, (2364), 78 states have call successors, (78), 34 states have call predecessors, (78), 34 states have return successors, (78), 66 states have call predecessors, (78), 78 states have call successors, (78) [2022-02-20 23:49:30,646 INFO L74 IsIncluded]: Start isIncluded. First operand 2115 states. Second operand has 1965 states, 1827 states have (on average 1.2939244663382594) internal successors, (2364), 1864 states have internal predecessors, (2364), 78 states have call successors, (78), 34 states have call predecessors, (78), 34 states have return successors, (78), 66 states have call predecessors, (78), 78 states have call successors, (78) [2022-02-20 23:49:30,647 INFO L87 Difference]: Start difference. First operand 2115 states. Second operand has 1965 states, 1827 states have (on average 1.2939244663382594) internal successors, (2364), 1864 states have internal predecessors, (2364), 78 states have call successors, (78), 34 states have call predecessors, (78), 34 states have return successors, (78), 66 states have call predecessors, (78), 78 states have call successors, (78) [2022-02-20 23:49:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,761 INFO L93 Difference]: Finished difference Result 2115 states and 2684 transitions. [2022-02-20 23:49:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2684 transitions. [2022-02-20 23:49:30,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:30,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:30,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 1965 states, 1827 states have (on average 1.2939244663382594) internal successors, (2364), 1864 states have internal predecessors, (2364), 78 states have call successors, (78), 34 states have call predecessors, (78), 34 states have return successors, (78), 66 states have call predecessors, (78), 78 states have call successors, (78) Second operand 2115 states. [2022-02-20 23:49:30,769 INFO L87 Difference]: Start difference. First operand has 1965 states, 1827 states have (on average 1.2939244663382594) internal successors, (2364), 1864 states have internal predecessors, (2364), 78 states have call successors, (78), 34 states have call predecessors, (78), 34 states have return successors, (78), 66 states have call predecessors, (78), 78 states have call successors, (78) Second operand 2115 states. [2022-02-20 23:49:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,894 INFO L93 Difference]: Finished difference Result 2115 states and 2684 transitions. [2022-02-20 23:49:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2684 transitions. [2022-02-20 23:49:30,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:30,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:30,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:30,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1827 states have (on average 1.2939244663382594) internal successors, (2364), 1864 states have internal predecessors, (2364), 78 states have call successors, (78), 34 states have call predecessors, (78), 34 states have return successors, (78), 66 states have call predecessors, (78), 78 states have call successors, (78) [2022-02-20 23:49:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2520 transitions. [2022-02-20 23:49:31,006 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2520 transitions. Word has length 48 [2022-02-20 23:49:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:31,007 INFO L470 AbstractCegarLoop]: Abstraction has 1965 states and 2520 transitions. [2022-02-20 23:49:31,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2520 transitions. [2022-02-20 23:49:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 23:49:31,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:31,007 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:31,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-20 23:49:31,008 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1987176999, now seen corresponding path program 1 times [2022-02-20 23:49:31,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:31,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508214026] [2022-02-20 23:49:31,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:31,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:31,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:31,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {114724#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {114724#true} is VALID [2022-02-20 23:49:31,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {114724#true} assume true; {114724#true} is VALID [2022-02-20 23:49:31,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {114724#true} {114726#(= |~#list~0.offset| 0)} #285#return; {114726#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:31,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {114724#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {114726#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:31,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {114726#(= |~#list~0.offset| 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {114726#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:31,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {114726#(= |~#list~0.offset| 0)} main_#t~short21#1 := ~i~0 < 3; {114726#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:31,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {114726#(= |~#list~0.offset| 0)} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {114726#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:31,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {114726#(= |~#list~0.offset| 0)} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {114726#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:31,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {114726#(= |~#list~0.offset| 0)} main_#t~short23#1 := main_~y~0#1 < 5; {114726#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:31,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {114726#(= |~#list~0.offset| 0)} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {114726#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:31,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {114726#(= |~#list~0.offset| 0)} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {114726#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:31,590 INFO L272 TraceCheckUtils]: 8: Hoare triple {114726#(= |~#list~0.offset| 0)} call main_#t~ret24#1 := rand_end_point(); {114724#true} is VALID [2022-02-20 23:49:31,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {114724#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {114724#true} is VALID [2022-02-20 23:49:31,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {114724#true} assume true; {114724#true} is VALID [2022-02-20 23:49:31,591 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {114724#true} {114726#(= |~#list~0.offset| 0)} #285#return; {114726#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:49:31,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {114726#(= |~#list~0.offset| 0)} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {114730#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (not (= 0 |ULTIMATE.start_append_one_~to#1|))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {114730#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (not (= 0 |ULTIMATE.start_append_one_~to#1|))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {114730#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (not (= 0 |ULTIMATE.start_append_one_~to#1|))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {114730#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (not (= 0 |ULTIMATE.start_append_one_~to#1|))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {114731#(and (= |~#list~0.offset| 0) (or (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|)) (or (not (= 0 |ULTIMATE.start_append_one_~to#1|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0)) (or (not (= 0 |ULTIMATE.start_append_one_~to#1|)) (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {114731#(and (= |~#list~0.offset| 0) (or (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|)) (or (not (= 0 |ULTIMATE.start_append_one_~to#1|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0)) (or (not (= 0 |ULTIMATE.start_append_one_~to#1|)) (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {114731#(and (= |~#list~0.offset| 0) (or (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|)) (or (not (= 0 |ULTIMATE.start_append_one_~to#1|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0)) (or (not (= 0 |ULTIMATE.start_append_one_~to#1|)) (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {114731#(and (= |~#list~0.offset| 0) (or (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|)) (or (not (= 0 |ULTIMATE.start_append_one_~to#1|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0)) (or (not (= 0 |ULTIMATE.start_append_one_~to#1|)) (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {114732#(and (= |~#list~0.offset| 0) (or (not |ULTIMATE.start_create_item_#t~switch6#1|) (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {114732#(and (= |~#list~0.offset| 0) (or (not |ULTIMATE.start_create_item_#t~switch6#1|) (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {114733#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {114733#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_#t~switch6#1; {114733#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {114733#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {114733#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {114733#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {114733#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {114733#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {114733#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {114733#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {114734#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} is VALID [2022-02-20 23:49:31,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {114734#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {114734#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} is VALID [2022-02-20 23:49:31,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {114734#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {114735#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_#res#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= |ULTIMATE.start_create_item_#res#1.offset| 0))} is VALID [2022-02-20 23:49:31,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {114735#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_#res#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= |ULTIMATE.start_create_item_#res#1.offset| 0))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {114736#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= 265 (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {114736#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= 265 (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {114737#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {114737#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {114738#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (= 0 |ULTIMATE.start_append_one_#t~mem9#1.offset|) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {114738#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (= 0 |ULTIMATE.start_append_one_#t~mem9#1.offset|) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {114737#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:31,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {114737#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} main_#t~short23#1 := main_~y~0#1 < 5; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} main_#t~short28#1 := main_~z~0#1 < 10; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} main_#t~short21#1 := ~i~0 < 3; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,607 INFO L290 TraceCheckUtils]: 40: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} is VALID [2022-02-20 23:49:31,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {114739#(and (= |~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) 0)) (= 265 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0))))} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {114740#(and (= |~#list~0.offset| 0) (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_NEXT) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) 265) (= |ULTIMATE.start_main_~end_point~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) 0) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|))} is VALID [2022-02-20 23:49:31,610 INFO L290 TraceCheckUtils]: 44: Hoare triple {114740#(and (= |~#list~0.offset| 0) (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_NEXT) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) 265) (= |ULTIMATE.start_main_~end_point~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) 0) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|))} SUMMARY for call main_#t~mem34#1.base, main_#t~mem34#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L751-2 {114741#(and (= |ULTIMATE.start_main_#t~mem34#1.offset| 0) (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|) (= 265 (select |#length| |ULTIMATE.start_main_#t~mem34#1.base|)))} is VALID [2022-02-20 23:49:31,610 INFO L290 TraceCheckUtils]: 45: Hoare triple {114741#(and (= |ULTIMATE.start_main_#t~mem34#1.offset| 0) (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|) (= 265 (select |#length| |ULTIMATE.start_main_#t~mem34#1.base|)))} main_~cursor~0#1.base, main_~cursor~0#1.offset := main_#t~mem34#1.base, main_#t~mem34#1.offset;havoc main_#t~mem34#1.base, main_#t~mem34#1.offset; {114742#(and (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_NEXT) (= 0 |ULTIMATE.start_main_~cursor~0#1.offset|) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|) (= (select |#length| |ULTIMATE.start_main_~cursor~0#1.base|) 265))} is VALID [2022-02-20 23:49:31,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {114742#(and (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_NEXT) (= 0 |ULTIMATE.start_main_~cursor~0#1.offset|) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|) (= (select |#length| |ULTIMATE.start_main_~cursor~0#1.base|) 265))} assume !!(main_~length~0#1 > 0); {114742#(and (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_NEXT) (= 0 |ULTIMATE.start_main_~cursor~0#1.offset|) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|) (= (select |#length| |ULTIMATE.start_main_~cursor~0#1.base|) 265))} is VALID [2022-02-20 23:49:31,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {114742#(and (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_NEXT) (= 0 |ULTIMATE.start_main_~cursor~0#1.offset|) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|) (= (select |#length| |ULTIMATE.start_main_~cursor~0#1.base|) 265))} assume !(4 + (main_~cursor~0#1.offset + 4 * main_~direction~0#1) <= #length[main_~cursor~0#1.base] && 0 <= main_~cursor~0#1.offset + 4 * main_~direction~0#1); {114725#false} is VALID [2022-02-20 23:49:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:31,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:31,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508214026] [2022-02-20 23:49:31,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508214026] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:31,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:31,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 23:49:31,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295013564] [2022-02-20 23:49:31,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-02-20 23:49:31,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:31,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:31,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:31,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:49:31,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:31,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:49:31,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:49:31,653 INFO L87 Difference]: Start difference. First operand 1965 states and 2520 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:34,424 INFO L93 Difference]: Finished difference Result 2303 states and 2927 transitions. [2022-02-20 23:49:34,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 23:49:34,424 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-02-20 23:49:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 348 transitions. [2022-02-20 23:49:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 348 transitions. [2022-02-20 23:49:34,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 348 transitions. [2022-02-20 23:49:34,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:34,828 INFO L225 Difference]: With dead ends: 2303 [2022-02-20 23:49:34,828 INFO L226 Difference]: Without dead ends: 2303 [2022-02-20 23:49:34,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2022-02-20 23:49:34,829 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 1459 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:34,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1459 Valid, 1175 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:49:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2022-02-20 23:49:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2169. [2022-02-20 23:49:34,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:34,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2303 states. Second operand has 2169 states, 2015 states have (on average 1.3076923076923077) internal successors, (2635), 2056 states have internal predecessors, (2635), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 72 states have call predecessors, (88), 88 states have call successors, (88) [2022-02-20 23:49:34,854 INFO L74 IsIncluded]: Start isIncluded. First operand 2303 states. Second operand has 2169 states, 2015 states have (on average 1.3076923076923077) internal successors, (2635), 2056 states have internal predecessors, (2635), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 72 states have call predecessors, (88), 88 states have call successors, (88) [2022-02-20 23:49:34,856 INFO L87 Difference]: Start difference. First operand 2303 states. Second operand has 2169 states, 2015 states have (on average 1.3076923076923077) internal successors, (2635), 2056 states have internal predecessors, (2635), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 72 states have call predecessors, (88), 88 states have call successors, (88) [2022-02-20 23:49:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:35,001 INFO L93 Difference]: Finished difference Result 2303 states and 2927 transitions. [2022-02-20 23:49:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2927 transitions. [2022-02-20 23:49:35,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:35,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:35,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 2169 states, 2015 states have (on average 1.3076923076923077) internal successors, (2635), 2056 states have internal predecessors, (2635), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 72 states have call predecessors, (88), 88 states have call successors, (88) Second operand 2303 states. [2022-02-20 23:49:35,007 INFO L87 Difference]: Start difference. First operand has 2169 states, 2015 states have (on average 1.3076923076923077) internal successors, (2635), 2056 states have internal predecessors, (2635), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 72 states have call predecessors, (88), 88 states have call successors, (88) Second operand 2303 states. [2022-02-20 23:49:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:35,157 INFO L93 Difference]: Finished difference Result 2303 states and 2927 transitions. [2022-02-20 23:49:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2927 transitions. [2022-02-20 23:49:35,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:35,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:35,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:35,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2015 states have (on average 1.3076923076923077) internal successors, (2635), 2056 states have internal predecessors, (2635), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 72 states have call predecessors, (88), 88 states have call successors, (88) [2022-02-20 23:49:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2811 transitions. [2022-02-20 23:49:35,291 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2811 transitions. Word has length 48 [2022-02-20 23:49:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:35,292 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 2811 transitions. [2022-02-20 23:49:35,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2811 transitions. [2022-02-20 23:49:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 23:49:35,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:35,292 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:35,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-02-20 23:49:35,293 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 53 more)] === [2022-02-20 23:49:35,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:35,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1985329958, now seen corresponding path program 1 times [2022-02-20 23:49:35,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:35,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659554892] [2022-02-20 23:49:35,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:35,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:36,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:36,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {123847#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {123847#true} is VALID [2022-02-20 23:49:36,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {123847#true} assume true; {123847#true} is VALID [2022-02-20 23:49:36,408 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123847#true} {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} #285#return; {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:36,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {123847#true} assume { :begin_inline_ULTIMATE.init } true;#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(14, 2);~i~0 := 0;~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:36,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_#t~post25#1, main_#t~post26#1, main_#t~nondet22#1, main_#t~short23#1, main_#t~ret29#1, main_#t~post30#1, main_#t~post31#1, main_#t~nondet27#1, main_#t~short28#1, main_#t~post32#1, main_#t~nondet20#1, main_#t~short21#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~post36#1, main_~next~1#1.base, main_~next~1#1.offset, main_~y~0#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~0#1.base, main_~cursor~0#1.offset;main_~y~0#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:36,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} main_#t~short21#1 := ~i~0 < 3; {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:36,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:36,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !!main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:36,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} main_#t~short23#1 := main_~y~0#1 < 5; {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:36,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:36,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !!main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:36,412 INFO L272 TraceCheckUtils]: 8: Hoare triple {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} call main_#t~ret24#1 := rand_end_point(); {123847#true} is VALID [2022-02-20 23:49:36,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {123847#true} assume 0 != ~i~0 - 3 || 0 != ~i~0 - 2;#res := ~unnamed1~0~LIST_BEG; {123847#true} is VALID [2022-02-20 23:49:36,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {123847#true} assume true; {123847#true} is VALID [2022-02-20 23:49:36,413 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {123847#true} {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} #285#return; {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:36,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {123849#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret24#1;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset, append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset, append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset, append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1; {123853#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (or (not (= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {123853#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (or (not (= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L695 {123854#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (or (not (= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {123854#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (or (not (= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~link#1.base, create_item_#in~link#1.offset := append_one_~to#1, append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_~at#1, create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~link#1.base, create_item_~link#1.offset := create_item_#in~link#1.base, create_item_#in~link#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {123855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (or (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|)) (or (not (= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (or (not (= 0 |ULTIMATE.start_append_one_~to#1|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {123855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (or (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|)) (or (not (= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (or (not (= 0 |ULTIMATE.start_append_one_~to#1|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {123855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (or (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|)) (or (not (= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (or (not (= 0 |ULTIMATE.start_append_one_~to#1|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {123855#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (or (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~at#1| |ULTIMATE.start_append_one_~to#1|)) (or (not (= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (or (not (= 0 |ULTIMATE.start_append_one_~to#1|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {123856#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (or (not |ULTIMATE.start_create_item_#t~switch6#1|) (and (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))) (or (not (= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {123856#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (or (not |ULTIMATE.start_create_item_#t~switch6#1|) (and (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))) (or (not (= (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {123857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {123857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_#t~switch6#1; {123857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {123857#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~link#1.base, create_item_~link#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L685 {123858#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {123858#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-1 {123858#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {123858#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {123858#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {123858#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {123859#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} is VALID [2022-02-20 23:49:36,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {123859#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} assume !(create_item_~link#1.base != 0 || create_item_~link#1.offset != 0); {123859#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} is VALID [2022-02-20 23:49:36,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {123859#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {123860#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= |ULTIMATE.start_create_item_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0))} is VALID [2022-02-20 23:49:36,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {123860#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= |ULTIMATE.start_create_item_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0))} append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset;havoc append_one_#t~mem7#1.base, append_one_#t~mem7#1.offset;havoc append_one_#t~ret8#1.base, append_one_#t~ret8#1.offset; {123861#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0))} is VALID [2022-02-20 23:49:36,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {123861#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 0 |ULTIMATE.start_append_one_~to#1|) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ |~#list~0.offset| 4)) 0))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1, 4); srcloc: L696 {123862#(and (= |~#list~0.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {123862#(and (= |~#list~0.offset| 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ |ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L696-1 {123863#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_#t~mem9#1.base| 0) (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (= 0 |ULTIMATE.start_append_one_#t~mem9#1.offset|) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {123863#(and (= |~#list~0.offset| 0) (or (= |ULTIMATE.start_append_one_#t~mem9#1.base| 0) (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (= 0 |ULTIMATE.start_append_one_#t~mem9#1.offset|) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(0 == append_one_#t~mem9#1.base && 0 == append_one_#t~mem9#1.offset);havoc append_one_#t~mem9#1.base, append_one_#t~mem9#1.offset; {123864#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:36,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {123864#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L697-1 {123865#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_#t~mem10#1.base| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_#t~mem10#1.offset| (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:36,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {123865#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_#t~mem10#1.base| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_#t~mem10#1.offset| (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !(0 == append_one_#t~mem10#1.base && 0 == append_one_#t~mem10#1.offset);havoc append_one_#t~mem10#1.base, append_one_#t~mem10#1.offset; {123848#false} is VALID [2022-02-20 23:49:36,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {123848#false} assume { :end_inline_append_one } true;havoc main_#t~ret24#1;main_#t~post25#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;main_#t~post26#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {123848#false} is VALID [2022-02-20 23:49:36,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {123848#false} main_#t~short23#1 := main_~y~0#1 < 5; {123848#false} is VALID [2022-02-20 23:49:36,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {123848#false} assume main_#t~short23#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647;main_#t~short23#1 := 0 != main_#t~nondet22#1; {123848#false} is VALID [2022-02-20 23:49:36,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {123848#false} assume !main_#t~short23#1;havoc main_#t~nondet22#1;havoc main_#t~short23#1; {123848#false} is VALID [2022-02-20 23:49:36,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {123848#false} main_#t~short28#1 := main_~z~0#1 < 10; {123848#false} is VALID [2022-02-20 23:49:36,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {123848#false} assume main_#t~short28#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647;main_#t~short28#1 := 0 != main_#t~nondet27#1; {123848#false} is VALID [2022-02-20 23:49:36,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {123848#false} assume !main_#t~short28#1;havoc main_#t~nondet27#1;havoc main_#t~short28#1; {123848#false} is VALID [2022-02-20 23:49:36,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {123848#false} main_~y~0#1 := 0;main_~z~0#1 := 0;main_#t~post32#1 := ~i~0;~i~0 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {123848#false} is VALID [2022-02-20 23:49:36,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {123848#false} main_#t~short21#1 := ~i~0 < 3; {123848#false} is VALID [2022-02-20 23:49:36,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {123848#false} assume main_#t~short21#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647;main_#t~short21#1 := 0 != main_#t~nondet20#1; {123848#false} is VALID [2022-02-20 23:49:36,429 INFO L290 TraceCheckUtils]: 41: Hoare triple {123848#false} assume !main_#t~short21#1;havoc main_#t~nondet20#1;havoc main_#t~short21#1; {123848#false} is VALID [2022-02-20 23:49:36,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {123848#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {123848#false} is VALID [2022-02-20 23:49:36,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {123848#false} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {123848#false} is VALID [2022-02-20 23:49:36,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {123848#false} SUMMARY for call main_#t~mem34#1.base, main_#t~mem34#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L751-2 {123848#false} is VALID [2022-02-20 23:49:36,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {123848#false} main_~cursor~0#1.base, main_~cursor~0#1.offset := main_#t~mem34#1.base, main_#t~mem34#1.offset;havoc main_#t~mem34#1.base, main_#t~mem34#1.offset; {123848#false} is VALID [2022-02-20 23:49:36,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {123848#false} assume !!(main_~length~0#1 > 0); {123848#false} is VALID [2022-02-20 23:49:36,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {123848#false} assume !(1 == #valid[main_~cursor~0#1.base]); {123848#false} is VALID [2022-02-20 23:49:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:36,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:36,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659554892] [2022-02-20 23:49:36,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659554892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:36,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:36,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-20 23:49:36,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028837482] [2022-02-20 23:49:36,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:36,431 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-02-20 23:49:36,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:36,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:36,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:36,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:49:36,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:36,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:49:36,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:49:36,477 INFO L87 Difference]: Start difference. First operand 2169 states and 2811 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)