./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0217.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/memsafety/test-0217.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 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:44:56,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:44:56,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:44:56,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:44:56,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:44:56,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:44:56,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:44:56,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:44:56,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:44:56,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:44:56,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:44:56,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:44:56,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:44:56,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:44:56,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:44:56,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:44:56,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:44:56,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:44:56,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:44:56,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:44:56,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:44:56,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:44:56,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:44:56,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:44:56,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:44:56,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:44:56,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:44:56,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:44:56,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:44:56,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:44:56,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:44:56,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:44:56,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:44:56,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:44:56,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:44:56,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:44:56,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:44:56,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:44:56,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:44:56,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:44:56,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:44:56,537 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:44:56,571 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:44:56,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:44:56,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:44:56,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:44:56,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:44:56,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:44:56,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:44:56,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:44:56,574 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:44:56,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:44:56,575 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:44:56,575 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:44:56,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:44:56,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:44:56,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:44:56,576 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:44:56,576 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:44:56,576 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:44:56,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:44:56,577 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:44:56,577 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:44:56,577 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:44:56,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:44:56,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:44:56,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:44:56,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:56,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:44:56,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:44:56,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:44:56,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:44:56,580 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 -> 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec [2022-02-20 23:44:56,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:44:56,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:44:56,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:44:56,815 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:44:56,815 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:44:56,816 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0217.i [2022-02-20 23:44:56,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba1b62c3/07f2c51e0fc04716a36fca3b65417769/FLAG956d11d8e [2022-02-20 23:44:57,305 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:44:57,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i [2022-02-20 23:44:57,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba1b62c3/07f2c51e0fc04716a36fca3b65417769/FLAG956d11d8e [2022-02-20 23:44:57,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba1b62c3/07f2c51e0fc04716a36fca3b65417769 [2022-02-20 23:44:57,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:44:57,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:44:57,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:57,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:44:57,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:44:57,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:57" (1/1) ... [2022-02-20 23:44:57,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69698a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57, skipping insertion in model container [2022-02-20 23:44:57,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:57" (1/1) ... [2022-02-20 23:44:57,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:44:57,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:44:58,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:58,049 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:44:58,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:58,120 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:44:58,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:58 WrapperNode [2022-02-20 23:44:58,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:58,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:58,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:44:58,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:44:58,130 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:44:58" (1/1) ... [2022-02-20 23:44:58,150 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:44:58" (1/1) ... [2022-02-20 23:44:58,193 INFO L137 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 218 [2022-02-20 23:44:58,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:58,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:44:58,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:44:58,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:44:58,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:58" (1/1) ... [2022-02-20 23:44:58,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:58" (1/1) ... [2022-02-20 23:44:58,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:58" (1/1) ... [2022-02-20 23:44:58,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:58" (1/1) ... [2022-02-20 23:44:58,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:58" (1/1) ... [2022-02-20 23:44:58,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:58" (1/1) ... [2022-02-20 23:44:58,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:58" (1/1) ... [2022-02-20 23:44:58,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:44:58,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:44:58,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:44:58,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:44:58,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:58" (1/1) ... [2022-02-20 23:44:58,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:58,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:58,298 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:44:58,300 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:44:58,342 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-02-20 23:44:58,343 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-02-20 23:44:58,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:44:58,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:44:58,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:44:58,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:44:58,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:44:58,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:44:58,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:44:58,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:44:58,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:44:58,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:44:58,527 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:44:58,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:44:59,180 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:44:59,187 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:44:59,188 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:44:59,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:59 BoogieIcfgContainer [2022-02-20 23:44:59,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:44:59,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:44:59,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:44:59,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:44:59,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:44:57" (1/3) ... [2022-02-20 23:44:59,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d4c1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:59, skipping insertion in model container [2022-02-20 23:44:59,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:58" (2/3) ... [2022-02-20 23:44:59,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d4c1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:59, skipping insertion in model container [2022-02-20 23:44:59,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:59" (3/3) ... [2022-02-20 23:44:59,196 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0217.i [2022-02-20 23:44:59,205 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:44:59,206 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-02-20 23:44:59,247 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:44:59,255 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:44:59,255 INFO L340 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2022-02-20 23:44:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 100 states have (on average 1.94) internal successors, (194), 167 states have internal predecessors, (194), 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:44:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:44:59,297 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:59,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:44:59,298 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:44:59,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:59,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1074949738, now seen corresponding path program 1 times [2022-02-20 23:44:59,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:59,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644966076] [2022-02-20 23:44:59,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:59,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#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(12, 2);~#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); {174#true} is VALID [2022-02-20 23:44:59,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {174#true} is VALID [2022-02-20 23:44:59,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#true} assume !true; {175#false} is VALID [2022-02-20 23:44:59,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {175#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {175#false} is VALID [2022-02-20 23:44:59,457 INFO L290 TraceCheckUtils]: 4: Hoare triple {175#false} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {175#false} is VALID [2022-02-20 23:44:59,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#false} assume !(1 == #valid[~#list~0.base]); {175#false} is VALID [2022-02-20 23:44:59,458 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:44:59,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:59,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644966076] [2022-02-20 23:44:59,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644966076] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:59,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:59,461 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:59,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721048380] [2022-02-20 23:44:59,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:59,466 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:44:59,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:59,471 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:44:59,483 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:44:59,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:44:59,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:59,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:44:59,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:44:59,514 INFO L87 Difference]: Start difference. First operand has 171 states, 100 states have (on average 1.94) internal successors, (194), 167 states have internal predecessors, (194), 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:44:59,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:59,670 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2022-02-20 23:44:59,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:44:59,671 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:44:59,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:59,672 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:44:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 198 transitions. [2022-02-20 23:44:59,682 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:44:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 198 transitions. [2022-02-20 23:44:59,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 198 transitions. [2022-02-20 23:44:59,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:59,927 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:44:59,928 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 23:44:59,930 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:44:59,934 INFO L933 BasicCegarLoop]: 192 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, 192 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:44:59,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 23:44:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-02-20 23:44:59,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:59,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 169 states, 99 states have (on average 1.878787878787879) internal successors, (186), 165 states have internal predecessors, (186), 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:44:59,971 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 169 states, 99 states have (on average 1.878787878787879) internal successors, (186), 165 states have internal predecessors, (186), 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:44:59,971 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 169 states, 99 states have (on average 1.878787878787879) internal successors, (186), 165 states have internal predecessors, (186), 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:44:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:59,981 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2022-02-20 23:44:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2022-02-20 23:44:59,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:59,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:59,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 99 states have (on average 1.878787878787879) internal successors, (186), 165 states have internal predecessors, (186), 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 169 states. [2022-02-20 23:44:59,984 INFO L87 Difference]: Start difference. First operand has 169 states, 99 states have (on average 1.878787878787879) internal successors, (186), 165 states have internal predecessors, (186), 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 169 states. [2022-02-20 23:44:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:59,992 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2022-02-20 23:44:59,992 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2022-02-20 23:44:59,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:59,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:59,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:59,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 99 states have (on average 1.878787878787879) internal successors, (186), 165 states have internal predecessors, (186), 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:45:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2022-02-20 23:45:00,003 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 6 [2022-02-20 23:45:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:00,004 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2022-02-20 23:45:00,004 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:45:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2022-02-20 23:45:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:00,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:00,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:00,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:45:00,005 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:00,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1280317330, now seen corresponding path program 1 times [2022-02-20 23:45:00,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:00,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106136535] [2022-02-20 23:45:00,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:00,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:00,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {856#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(12, 2);~#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); {858#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:45:00,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {858#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {858#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:45:00,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {858#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {858#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:45:00,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {858#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {858#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:45:00,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {858#(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~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {858#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:45:00,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {858#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {858#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:45:00,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {858#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume !(1 == #valid[~#list~0.base]); {857#false} is VALID [2022-02-20 23:45:00,083 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:45:00,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:00,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106136535] [2022-02-20 23:45:00,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106136535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:00,084 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:00,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-20 23:45:00,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730516711] [2022-02-20 23:45:00,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:00,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-02-20 23:45:00,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:00,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:45:00,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:00,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:00,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:00,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:00,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:00,095 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:45:00,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:00,595 INFO L93 Difference]: Finished difference Result 329 states and 370 transitions. [2022-02-20 23:45:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:00,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-02-20 23:45:00,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:45:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2022-02-20 23:45:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:45:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2022-02-20 23:45:00,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 371 transitions. [2022-02-20 23:45:00,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:00,970 INFO L225 Difference]: With dead ends: 329 [2022-02-20 23:45:00,970 INFO L226 Difference]: Without dead ends: 329 [2022-02-20 23:45:00,970 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:45:00,972 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 171 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:00,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 249 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-02-20 23:45:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 233. [2022-02-20 23:45:00,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:00,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 233 states, 160 states have (on average 1.8625) internal successors, (298), 226 states have internal predecessors, (298), 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:45:00,985 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 233 states, 160 states have (on average 1.8625) internal successors, (298), 226 states have internal predecessors, (298), 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:45:00,986 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 233 states, 160 states have (on average 1.8625) internal successors, (298), 226 states have internal predecessors, (298), 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:45:00,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:01,000 INFO L93 Difference]: Finished difference Result 329 states and 370 transitions. [2022-02-20 23:45:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 370 transitions. [2022-02-20 23:45:01,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:01,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:01,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 160 states have (on average 1.8625) internal successors, (298), 226 states have internal predecessors, (298), 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 329 states. [2022-02-20 23:45:01,004 INFO L87 Difference]: Start difference. First operand has 233 states, 160 states have (on average 1.8625) internal successors, (298), 226 states have internal predecessors, (298), 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 329 states. [2022-02-20 23:45:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:01,018 INFO L93 Difference]: Finished difference Result 329 states and 370 transitions. [2022-02-20 23:45:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 370 transitions. [2022-02-20 23:45:01,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:01,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:01,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:01,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 160 states have (on average 1.8625) internal successors, (298), 226 states have internal predecessors, (298), 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:45:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2022-02-20 23:45:01,029 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 7 [2022-02-20 23:45:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:01,030 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2022-02-20 23:45:01,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:45:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2022-02-20 23:45:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:01,031 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:01,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:01,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:45:01,032 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:01,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1280317329, now seen corresponding path program 1 times [2022-02-20 23:45:01,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:01,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751323164] [2022-02-20 23:45:01,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:01,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {2081#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(12, 2);~#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); {2083#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:01,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {2083#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {2083#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:01,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {2083#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {2083#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:01,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {2083#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {2083#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:01,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {2083#(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~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {2083#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:01,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {2083#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {2084#(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:45:01,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {2084#(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); {2082#false} is VALID [2022-02-20 23:45:01,184 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:45:01,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:01,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751323164] [2022-02-20 23:45:01,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751323164] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:01,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:01,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:01,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597197087] [2022-02-20 23:45:01,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:01,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-02-20 23:45:01,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:01,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:01,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:01,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:01,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:01,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:01,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:01,194 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:01,799 INFO L93 Difference]: Finished difference Result 376 states and 474 transitions. [2022-02-20 23:45:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:01,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-02-20 23:45:01,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:01,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2022-02-20 23:45:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2022-02-20 23:45:01,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 319 transitions. [2022-02-20 23:45:02,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:02,073 INFO L225 Difference]: With dead ends: 376 [2022-02-20 23:45:02,074 INFO L226 Difference]: Without dead ends: 376 [2022-02-20 23:45:02,074 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:45:02,075 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 141 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:02,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 422 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-02-20 23:45:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 310. [2022-02-20 23:45:02,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:02,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 376 states. Second operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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:45:02,090 INFO L74 IsIncluded]: Start isIncluded. First operand 376 states. Second operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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:45:02,090 INFO L87 Difference]: Start difference. First operand 376 states. Second operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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:45:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:02,103 INFO L93 Difference]: Finished difference Result 376 states and 474 transitions. [2022-02-20 23:45:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 474 transitions. [2022-02-20 23:45:02,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:02,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:02,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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 376 states. [2022-02-20 23:45:02,106 INFO L87 Difference]: Start difference. First operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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 376 states. [2022-02-20 23:45:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:02,120 INFO L93 Difference]: Finished difference Result 376 states and 474 transitions. [2022-02-20 23:45:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 474 transitions. [2022-02-20 23:45:02,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:02,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:02,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:02,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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:45:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2022-02-20 23:45:02,133 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 7 [2022-02-20 23:45:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:02,134 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2022-02-20 23:45:02,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2022-02-20 23:45:02,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:02,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:02,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:02,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:45:02,135 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:02,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:02,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1280317267, now seen corresponding path program 1 times [2022-02-20 23:45:02,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:02,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758512288] [2022-02-20 23:45:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:02,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:02,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {3527#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(12, 2);~#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); {3529#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:02,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {3529#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {3529#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:02,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {3529#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {3529#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:02,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {3529#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {3529#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:02,228 INFO L290 TraceCheckUtils]: 4: Hoare triple {3529#(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~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {3529#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:02,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {3529#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {3530#(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:45:02,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {3530#(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); {3528#false} is VALID [2022-02-20 23:45:02,229 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:45:02,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:02,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758512288] [2022-02-20 23:45:02,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758512288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:02,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:02,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:02,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433302220] [2022-02-20 23:45:02,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:02,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-02-20 23:45:02,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:02,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:02,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:02,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:02,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:02,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:02,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:02,239 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:02,792 INFO L93 Difference]: Finished difference Result 375 states and 472 transitions. [2022-02-20 23:45:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:02,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-02-20 23:45:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2022-02-20 23:45:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2022-02-20 23:45:02,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 318 transitions. [2022-02-20 23:45:03,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:03,041 INFO L225 Difference]: With dead ends: 375 [2022-02-20 23:45:03,041 INFO L226 Difference]: Without dead ends: 375 [2022-02-20 23:45:03,042 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:45:03,051 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 123 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:03,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 436 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-02-20 23:45:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 310. [2022-02-20 23:45:03,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:03,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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:45:03,066 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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:45:03,067 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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:45:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:03,080 INFO L93 Difference]: Finished difference Result 375 states and 472 transitions. [2022-02-20 23:45:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 472 transitions. [2022-02-20 23:45:03,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:03,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:03,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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 375 states. [2022-02-20 23:45:03,083 INFO L87 Difference]: Start difference. First operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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 375 states. [2022-02-20 23:45:03,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:03,094 INFO L93 Difference]: Finished difference Result 375 states and 472 transitions. [2022-02-20 23:45:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 472 transitions. [2022-02-20 23:45:03,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:03,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:03,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:03,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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:45:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2022-02-20 23:45:03,104 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 7 [2022-02-20 23:45:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:03,104 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2022-02-20 23:45:03,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2022-02-20 23:45:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:45:03,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:03,105 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:03,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:45:03,105 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:03,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1671227278, now seen corresponding path program 1 times [2022-02-20 23:45:03,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:03,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394680647] [2022-02-20 23:45:03,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:03,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {4970#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(12, 2);~#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); {4972#(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:45:03,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {4972#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {4972#(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:45:03,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {4972#(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~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {4972#(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:45:03,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {4972#(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 !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {4972#(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:45:03,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {4972#(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))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {4972#(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:45:03,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {4972#(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 0 != main_#t~nondet35#1;havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {4973#(and (or (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)) (not (= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) 0))) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)))} is VALID [2022-02-20 23:45:03,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {4973#(and (or (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)) (not (= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) 0))) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)))} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L737-2 {4974#(and (= |ULTIMATE.start_main_#t~mem36#1.offset| 0) (= |ULTIMATE.start_main_#t~mem36#1.base| 0))} is VALID [2022-02-20 23:45:03,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {4974#(and (= |ULTIMATE.start_main_#t~mem36#1.offset| 0) (= |ULTIMATE.start_main_#t~mem36#1.base| 0))} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset; {4975#(and (= |ULTIMATE.start_main_~cursor~1#1.base| 0) (= |ULTIMATE.start_main_~cursor~1#1.offset| 0))} is VALID [2022-02-20 23:45:03,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {4975#(and (= |ULTIMATE.start_main_~cursor~1#1.base| 0) (= |ULTIMATE.start_main_~cursor~1#1.offset| 0))} assume !!(main_~cursor~1#1.base != 0 || main_~cursor~1#1.offset != 0); {4971#false} is VALID [2022-02-20 23:45:03,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {4971#false} assume !(1 == #valid[main_~cursor~1#1.base]); {4971#false} is VALID [2022-02-20 23:45:03,251 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:45:03,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:03,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394680647] [2022-02-20 23:45:03,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394680647] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:03,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:03,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:03,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488077557] [2022-02-20 23:45:03,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:03,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-02-20 23:45:03,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:03,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:45:03,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:03,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:03,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:03,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:03,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:03,264 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:45:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:04,133 INFO L93 Difference]: Finished difference Result 461 states and 621 transitions. [2022-02-20 23:45:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:04,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-02-20 23:45:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:45:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 337 transitions. [2022-02-20 23:45:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:45:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 337 transitions. [2022-02-20 23:45:04,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 337 transitions. [2022-02-20 23:45:04,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:04,409 INFO L225 Difference]: With dead ends: 461 [2022-02-20 23:45:04,409 INFO L226 Difference]: Without dead ends: 461 [2022-02-20 23:45:04,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:04,410 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 150 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:04,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 803 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:04,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-02-20 23:45:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 352. [2022-02-20 23:45:04,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:04,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand has 352 states, 270 states have (on average 1.8074074074074074) internal successors, (488), 339 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:04,420 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand has 352 states, 270 states have (on average 1.8074074074074074) internal successors, (488), 339 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:04,421 INFO L87 Difference]: Start difference. First operand 461 states. Second operand has 352 states, 270 states have (on average 1.8074074074074074) internal successors, (488), 339 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:04,436 INFO L93 Difference]: Finished difference Result 461 states and 621 transitions. [2022-02-20 23:45:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 621 transitions. [2022-02-20 23:45:04,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:04,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:04,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 352 states, 270 states have (on average 1.8074074074074074) internal successors, (488), 339 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 461 states. [2022-02-20 23:45:04,439 INFO L87 Difference]: Start difference. First operand has 352 states, 270 states have (on average 1.8074074074074074) internal successors, (488), 339 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 461 states. [2022-02-20 23:45:04,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:04,453 INFO L93 Difference]: Finished difference Result 461 states and 621 transitions. [2022-02-20 23:45:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 621 transitions. [2022-02-20 23:45:04,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:04,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:04,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:04,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 270 states have (on average 1.8074074074074074) internal successors, (488), 339 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 508 transitions. [2022-02-20 23:45:04,465 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 508 transitions. Word has length 10 [2022-02-20 23:45:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:04,465 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 508 transitions. [2022-02-20 23:45:04,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:45:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 508 transitions. [2022-02-20 23:45:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:45:04,466 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:04,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:04,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:45:04,466 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:04,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:04,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1673074320, now seen corresponding path program 1 times [2022-02-20 23:45:04,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:04,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709284732] [2022-02-20 23:45:04,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:04,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:04,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {6721#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(12, 2);~#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); {6723#(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))))} is VALID [2022-02-20 23:45:04,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {6723#(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))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {6723#(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))))} is VALID [2022-02-20 23:45:04,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {6723#(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))))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {6723#(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))))} is VALID [2022-02-20 23:45:04,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {6723#(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))))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {6723#(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))))} is VALID [2022-02-20 23:45:04,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {6723#(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))))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {6723#(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))))} is VALID [2022-02-20 23:45:04,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {6723#(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))))} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {6724#(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_main_~end_point~0#1| 4) 4))} is VALID [2022-02-20 23:45:04,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {6724#(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_main_~end_point~0#1| 4) 4))} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L737-2 {6725#(and (= |ULTIMATE.start_main_#t~mem36#1.offset| 0) (= |ULTIMATE.start_main_#t~mem36#1.base| 0))} is VALID [2022-02-20 23:45:04,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {6725#(and (= |ULTIMATE.start_main_#t~mem36#1.offset| 0) (= |ULTIMATE.start_main_#t~mem36#1.base| 0))} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset; {6726#(and (= |ULTIMATE.start_main_~cursor~1#1.base| 0) (= |ULTIMATE.start_main_~cursor~1#1.offset| 0))} is VALID [2022-02-20 23:45:04,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {6726#(and (= |ULTIMATE.start_main_~cursor~1#1.base| 0) (= |ULTIMATE.start_main_~cursor~1#1.offset| 0))} assume !!(main_~cursor~1#1.base != 0 || main_~cursor~1#1.offset != 0); {6722#false} is VALID [2022-02-20 23:45:04,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {6722#false} assume !(1 == #valid[main_~cursor~1#1.base]); {6722#false} is VALID [2022-02-20 23:45:04,601 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:45:04,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:04,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709284732] [2022-02-20 23:45:04,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709284732] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:04,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:04,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:04,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482802359] [2022-02-20 23:45:04,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:04,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-02-20 23:45:04,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:04,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:45:04,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:04,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:04,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:04,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:04,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:04,612 INFO L87 Difference]: Start difference. First operand 352 states and 508 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:45:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:05,410 INFO L93 Difference]: Finished difference Result 451 states and 610 transitions. [2022-02-20 23:45:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:05,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-02-20 23:45:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:45:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 326 transitions. [2022-02-20 23:45:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:45:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 326 transitions. [2022-02-20 23:45:05,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 326 transitions. [2022-02-20 23:45:05,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:05,697 INFO L225 Difference]: With dead ends: 451 [2022-02-20 23:45:05,698 INFO L226 Difference]: Without dead ends: 451 [2022-02-20 23:45:05,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:45:05,700 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 131 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:05,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 812 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-02-20 23:45:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 351. [2022-02-20 23:45:05,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:05,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 351 states, 269 states have (on average 1.8104089219330854) internal successors, (487), 338 states have internal predecessors, (487), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:05,709 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 351 states, 269 states have (on average 1.8104089219330854) internal successors, (487), 338 states have internal predecessors, (487), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:05,710 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 351 states, 269 states have (on average 1.8104089219330854) internal successors, (487), 338 states have internal predecessors, (487), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:05,727 INFO L93 Difference]: Finished difference Result 451 states and 610 transitions. [2022-02-20 23:45:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 610 transitions. [2022-02-20 23:45:05,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:05,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:05,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 269 states have (on average 1.8104089219330854) internal successors, (487), 338 states have internal predecessors, (487), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 451 states. [2022-02-20 23:45:05,730 INFO L87 Difference]: Start difference. First operand has 351 states, 269 states have (on average 1.8104089219330854) internal successors, (487), 338 states have internal predecessors, (487), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 451 states. [2022-02-20 23:45:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:05,745 INFO L93 Difference]: Finished difference Result 451 states and 610 transitions. [2022-02-20 23:45:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 610 transitions. [2022-02-20 23:45:05,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:05,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:05,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:05,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 269 states have (on average 1.8104089219330854) internal successors, (487), 338 states have internal predecessors, (487), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 507 transitions. [2022-02-20 23:45:05,756 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 507 transitions. Word has length 10 [2022-02-20 23:45:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:05,756 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 507 transitions. [2022-02-20 23:45:05,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:45:05,757 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 507 transitions. [2022-02-20 23:45:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:45:05,757 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:05,757 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:05,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:45:05,758 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash 268436822, now seen corresponding path program 1 times [2022-02-20 23:45:05,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:05,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197324041] [2022-02-20 23:45:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:05,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:05,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {8439#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(12, 2);~#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); {8439#true} is VALID [2022-02-20 23:45:05,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {8439#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:05,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:05,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:05,784 INFO L290 TraceCheckUtils]: 4: Hoare triple {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:05,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:05,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L737-2 {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:05,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset; {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:05,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(main_~cursor~1#1.base != 0 || main_~cursor~1#1.offset != 0); {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:05,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:05,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {8441#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {8440#false} is VALID [2022-02-20 23:45:05,788 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:45:05,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:05,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197324041] [2022-02-20 23:45:05,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197324041] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:05,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:05,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:05,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134279307] [2022-02-20 23:45:05,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:05,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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:45:05,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:05,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) 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:45:05,797 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:45:05,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:05,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:05,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:05,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:05,799 INFO L87 Difference]: Start difference. First operand 351 states and 507 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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:45:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:06,069 INFO L93 Difference]: Finished difference Result 406 states and 560 transitions. [2022-02-20 23:45:06,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:06,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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:45:06,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) 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:45:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2022-02-20 23:45:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) 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:45:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2022-02-20 23:45:06,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 277 transitions. [2022-02-20 23:45:06,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:06,272 INFO L225 Difference]: With dead ends: 406 [2022-02-20 23:45:06,272 INFO L226 Difference]: Without dead ends: 399 [2022-02-20 23:45:06,273 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:45:06,274 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 70 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:06,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 287 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-02-20 23:45:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 348. [2022-02-20 23:45:06,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:06,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 399 states. Second operand has 348 states, 266 states have (on average 1.8120300751879699) internal successors, (482), 335 states have internal predecessors, (482), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:06,283 INFO L74 IsIncluded]: Start isIncluded. First operand 399 states. Second operand has 348 states, 266 states have (on average 1.8120300751879699) internal successors, (482), 335 states have internal predecessors, (482), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:06,284 INFO L87 Difference]: Start difference. First operand 399 states. Second operand has 348 states, 266 states have (on average 1.8120300751879699) internal successors, (482), 335 states have internal predecessors, (482), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:06,295 INFO L93 Difference]: Finished difference Result 399 states and 552 transitions. [2022-02-20 23:45:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 552 transitions. [2022-02-20 23:45:06,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:06,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:06,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 348 states, 266 states have (on average 1.8120300751879699) internal successors, (482), 335 states have internal predecessors, (482), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 399 states. [2022-02-20 23:45:06,298 INFO L87 Difference]: Start difference. First operand has 348 states, 266 states have (on average 1.8120300751879699) internal successors, (482), 335 states have internal predecessors, (482), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 399 states. [2022-02-20 23:45:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:06,309 INFO L93 Difference]: Finished difference Result 399 states and 552 transitions. [2022-02-20 23:45:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 552 transitions. [2022-02-20 23:45:06,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:06,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:06,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:06,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 266 states have (on average 1.8120300751879699) internal successors, (482), 335 states have internal predecessors, (482), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 502 transitions. [2022-02-20 23:45:06,322 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 502 transitions. Word has length 11 [2022-02-20 23:45:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:06,323 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 502 transitions. [2022-02-20 23:45:06,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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:45:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 502 transitions. [2022-02-20 23:45:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:45:06,324 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:06,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:06,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:45:06,324 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1044692257, now seen corresponding path program 1 times [2022-02-20 23:45:06,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:06,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962033623] [2022-02-20 23:45:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:06,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:06,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {9996#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {9996#true} is VALID [2022-02-20 23:45:06,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {9996#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {9996#true} is VALID [2022-02-20 23:45:06,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {9996#true} assume true; {9996#true} is VALID [2022-02-20 23:45:06,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9996#true} {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #312#return; {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:06,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {9996#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(12, 2);~#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); {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:06,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {9998#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:06,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:06,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:06,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:06,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:06,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:06,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:06,414 INFO L272 TraceCheckUtils]: 8: Hoare triple {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret34#1 := rand_end_point(); {9996#true} is VALID [2022-02-20 23:45:06,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {9996#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {9996#true} is VALID [2022-02-20 23:45:06,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {9996#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {9996#true} is VALID [2022-02-20 23:45:06,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {9996#true} assume true; {9996#true} is VALID [2022-02-20 23:45:06,416 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9996#true} {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #312#return; {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:06,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {9998#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {10003#(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:45:06,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {10003#(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]); {9997#false} is VALID [2022-02-20 23:45:06,420 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:45:06,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:06,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962033623] [2022-02-20 23:45:06,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962033623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:06,421 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:06,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:06,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160296025] [2022-02-20 23:45:06,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:06,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-02-20 23:45:06,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:06,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:06,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:06,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:06,434 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:06,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:06,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:06,435 INFO L87 Difference]: Start difference. First operand 348 states and 502 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:07,112 INFO L93 Difference]: Finished difference Result 570 states and 734 transitions. [2022-02-20 23:45:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:07,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-02-20 23:45:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2022-02-20 23:45:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2022-02-20 23:45:07,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 482 transitions. [2022-02-20 23:45:07,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 482 edges. 482 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:07,498 INFO L225 Difference]: With dead ends: 570 [2022-02-20 23:45:07,499 INFO L226 Difference]: Without dead ends: 570 [2022-02-20 23:45:07,499 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:45:07,500 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 329 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:07,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 434 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-02-20 23:45:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 354. [2022-02-20 23:45:07,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:07,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 570 states. Second operand has 354 states, 272 states have (on average 1.7941176470588236) internal successors, (488), 341 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:07,509 INFO L74 IsIncluded]: Start isIncluded. First operand 570 states. Second operand has 354 states, 272 states have (on average 1.7941176470588236) internal successors, (488), 341 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:07,510 INFO L87 Difference]: Start difference. First operand 570 states. Second operand has 354 states, 272 states have (on average 1.7941176470588236) internal successors, (488), 341 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:07,528 INFO L93 Difference]: Finished difference Result 570 states and 734 transitions. [2022-02-20 23:45:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 734 transitions. [2022-02-20 23:45:07,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:07,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:07,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 354 states, 272 states have (on average 1.7941176470588236) internal successors, (488), 341 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 570 states. [2022-02-20 23:45:07,531 INFO L87 Difference]: Start difference. First operand has 354 states, 272 states have (on average 1.7941176470588236) internal successors, (488), 341 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 570 states. [2022-02-20 23:45:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:07,548 INFO L93 Difference]: Finished difference Result 570 states and 734 transitions. [2022-02-20 23:45:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 734 transitions. [2022-02-20 23:45:07,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:07,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:07,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:07,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 272 states have (on average 1.7941176470588236) internal successors, (488), 341 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 508 transitions. [2022-02-20 23:45:07,559 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 508 transitions. Word has length 15 [2022-02-20 23:45:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:07,559 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 508 transitions. [2022-02-20 23:45:07,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 508 transitions. [2022-02-20 23:45:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:45:07,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:07,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:07,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:45:07,560 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:07,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:07,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1044692256, now seen corresponding path program 1 times [2022-02-20 23:45:07,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:07,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280151468] [2022-02-20 23:45:07,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:07,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:07,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:07,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {12072#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {12072#true} is VALID [2022-02-20 23:45:07,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {12072#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {12072#true} is VALID [2022-02-20 23:45:07,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {12072#true} assume true; {12072#true} is VALID [2022-02-20 23:45:07,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12072#true} {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #312#return; {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:07,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {12072#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(12, 2);~#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); {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:07,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {12074#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:07,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:07,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:07,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:07,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:07,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:07,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:07,642 INFO L272 TraceCheckUtils]: 8: Hoare triple {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret34#1 := rand_end_point(); {12072#true} is VALID [2022-02-20 23:45:07,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {12072#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {12072#true} is VALID [2022-02-20 23:45:07,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {12072#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {12072#true} is VALID [2022-02-20 23:45:07,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {12072#true} assume true; {12072#true} is VALID [2022-02-20 23:45:07,643 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12072#true} {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #312#return; {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:07,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {12074#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {12079#(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:45:07,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {12079#(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); {12073#false} is VALID [2022-02-20 23:45:07,645 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:45:07,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:07,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280151468] [2022-02-20 23:45:07,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280151468] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:07,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:07,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:07,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927263174] [2022-02-20 23:45:07,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:07,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-02-20 23:45:07,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:07,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:07,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:07,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:07,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:07,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:07,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:07,665 INFO L87 Difference]: Start difference. First operand 354 states and 508 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:08,182 INFO L93 Difference]: Finished difference Result 408 states and 530 transitions. [2022-02-20 23:45:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:08,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-02-20 23:45:08,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2022-02-20 23:45:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2022-02-20 23:45:08,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 314 transitions. [2022-02-20 23:45:08,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:08,453 INFO L225 Difference]: With dead ends: 408 [2022-02-20 23:45:08,454 INFO L226 Difference]: Without dead ends: 408 [2022-02-20 23:45:08,454 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:45:08,454 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 197 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:08,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 445 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-02-20 23:45:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 354. [2022-02-20 23:45:08,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:08,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 408 states. Second operand has 354 states, 272 states have (on average 1.7610294117647058) internal successors, (479), 341 states have internal predecessors, (479), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:08,480 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand has 354 states, 272 states have (on average 1.7610294117647058) internal successors, (479), 341 states have internal predecessors, (479), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:08,481 INFO L87 Difference]: Start difference. First operand 408 states. Second operand has 354 states, 272 states have (on average 1.7610294117647058) internal successors, (479), 341 states have internal predecessors, (479), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:08,491 INFO L93 Difference]: Finished difference Result 408 states and 530 transitions. [2022-02-20 23:45:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 530 transitions. [2022-02-20 23:45:08,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:08,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:08,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 354 states, 272 states have (on average 1.7610294117647058) internal successors, (479), 341 states have internal predecessors, (479), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 408 states. [2022-02-20 23:45:08,493 INFO L87 Difference]: Start difference. First operand has 354 states, 272 states have (on average 1.7610294117647058) internal successors, (479), 341 states have internal predecessors, (479), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 408 states. [2022-02-20 23:45:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:08,504 INFO L93 Difference]: Finished difference Result 408 states and 530 transitions. [2022-02-20 23:45:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 530 transitions. [2022-02-20 23:45:08,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:08,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:08,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:08,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 272 states have (on average 1.7610294117647058) internal successors, (479), 341 states have internal predecessors, (479), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 499 transitions. [2022-02-20 23:45:08,515 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 499 transitions. Word has length 15 [2022-02-20 23:45:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:08,516 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 499 transitions. [2022-02-20 23:45:08,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 499 transitions. [2022-02-20 23:45:08,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:45:08,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:08,518 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:45:08,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:45:08,519 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:08,523 INFO L85 PathProgramCache]: Analyzing trace with hash 742849514, now seen corresponding path program 1 times [2022-02-20 23:45:08,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:08,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841098932] [2022-02-20 23:45:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:08,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:08,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {13662#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {13662#true} is VALID [2022-02-20 23:45:08,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {13662#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {13662#true} is VALID [2022-02-20 23:45:08,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {13662#true} assume true; {13662#true} is VALID [2022-02-20 23:45:08,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13662#true} {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #310#return; {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {13662#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(12, 2);~#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); {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {13664#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret32#1 := rand_end_point(); {13662#true} is VALID [2022-02-20 23:45:08,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {13662#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {13662#true} is VALID [2022-02-20 23:45:08,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {13662#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {13662#true} is VALID [2022-02-20 23:45:08,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {13662#true} assume true; {13662#true} is VALID [2022-02-20 23:45:08,644 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13662#true} {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #310#return; {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {13664#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {13669#(and (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (or (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_create_item_~item~0#1.base|) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:08,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {13669#(and (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (or (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_create_item_~item~0#1.base|) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|))))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {13670#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} is VALID [2022-02-20 23:45:08,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {13670#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 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; {13670#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} is VALID [2022-02-20 23:45:08,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {13670#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 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; {13670#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} is VALID [2022-02-20 23:45:08,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {13670#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} havoc create_item_#t~switch6#1; {13670#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} is VALID [2022-02-20 23:45:08,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {13670#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} assume !(1 == #valid[create_item_~cursor#1.base]); {13663#false} is VALID [2022-02-20 23:45:08,663 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:45:08,663 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:08,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841098932] [2022-02-20 23:45:08,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841098932] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:08,663 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:08,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:08,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786754542] [2022-02-20 23:45:08,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:08,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:08,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:08,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:08,677 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:45:08,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:08,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:08,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:08,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:08,678 INFO L87 Difference]: Start difference. First operand 354 states and 499 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:09,779 INFO L93 Difference]: Finished difference Result 707 states and 854 transitions. [2022-02-20 23:45:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:09,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:09,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 705 transitions. [2022-02-20 23:45:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 705 transitions. [2022-02-20 23:45:09,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 705 transitions. [2022-02-20 23:45:10,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 705 edges. 705 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:10,384 INFO L225 Difference]: With dead ends: 707 [2022-02-20 23:45:10,385 INFO L226 Difference]: Without dead ends: 707 [2022-02-20 23:45:10,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:10,386 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 805 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:10,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [807 Valid, 561 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:45:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-02-20 23:45:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 351. [2022-02-20 23:45:10,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:10,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 707 states. Second operand has 351 states, 273 states have (on average 1.7326007326007327) internal successors, (473), 338 states have internal predecessors, (473), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:10,401 INFO L74 IsIncluded]: Start isIncluded. First operand 707 states. Second operand has 351 states, 273 states have (on average 1.7326007326007327) internal successors, (473), 338 states have internal predecessors, (473), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:10,402 INFO L87 Difference]: Start difference. First operand 707 states. Second operand has 351 states, 273 states have (on average 1.7326007326007327) internal successors, (473), 338 states have internal predecessors, (473), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:10,428 INFO L93 Difference]: Finished difference Result 707 states and 854 transitions. [2022-02-20 23:45:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 854 transitions. [2022-02-20 23:45:10,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:10,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:10,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 273 states have (on average 1.7326007326007327) internal successors, (473), 338 states have internal predecessors, (473), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 707 states. [2022-02-20 23:45:10,432 INFO L87 Difference]: Start difference. First operand has 351 states, 273 states have (on average 1.7326007326007327) internal successors, (473), 338 states have internal predecessors, (473), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 707 states. [2022-02-20 23:45:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:10,456 INFO L93 Difference]: Finished difference Result 707 states and 854 transitions. [2022-02-20 23:45:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 854 transitions. [2022-02-20 23:45:10,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:10,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:10,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:10,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 273 states have (on average 1.7326007326007327) internal successors, (473), 338 states have internal predecessors, (473), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:45:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 493 transitions. [2022-02-20 23:45:10,468 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 493 transitions. Word has length 17 [2022-02-20 23:45:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:10,468 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 493 transitions. [2022-02-20 23:45:10,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 493 transitions. [2022-02-20 23:45:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:45:10,469 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:10,469 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:45:10,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:45:10,470 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:10,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:10,470 INFO L85 PathProgramCache]: Analyzing trace with hash 742849515, now seen corresponding path program 1 times [2022-02-20 23:45:10,470 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:10,470 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952966947] [2022-02-20 23:45:10,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:10,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:10,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:10,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {16149#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {16149#true} is VALID [2022-02-20 23:45:10,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {16149#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {16159#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:10,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {16159#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {16159#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:10,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16159#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #310#return; {16156#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))) (<= (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (* ~unnamed1~0~LIST_BEG 4)))} is VALID [2022-02-20 23:45:10,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {16149#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(12, 2);~#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); {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:10,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:10,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:10,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:10,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:10,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:10,643 INFO L272 TraceCheckUtils]: 6: Hoare triple {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret32#1 := rand_end_point(); {16149#true} is VALID [2022-02-20 23:45:10,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {16149#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {16149#true} is VALID [2022-02-20 23:45:10,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {16149#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {16159#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:10,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {16159#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {16159#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:10,645 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16159#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {16151#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #310#return; {16156#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))) (<= (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (* ~unnamed1~0~LIST_BEG 4)))} is VALID [2022-02-20 23:45:10,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {16156#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))) (<= (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (* ~unnamed1~0~LIST_BEG 4)))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {16157#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:10,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {16157#(and (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {16158#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:10,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {16158#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#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; {16158#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:10,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {16158#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#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; {16158#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:10,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {16158#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} havoc create_item_#t~switch6#1; {16158#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:10,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {16158#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} assume !(4 + create_item_~cursor#1.offset <= #length[create_item_~cursor#1.base] && 0 <= create_item_~cursor#1.offset); {16150#false} is VALID [2022-02-20 23:45:10,649 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:45:10,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:10,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952966947] [2022-02-20 23:45:10,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952966947] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:10,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:10,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:10,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774673676] [2022-02-20 23:45:10,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:10,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:45:10,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:10,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:45:10,669 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:45:10,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:10,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:10,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:10,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:10,671 INFO L87 Difference]: Start difference. First operand 351 states and 493 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:45:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:12,696 INFO L93 Difference]: Finished difference Result 766 states and 951 transitions. [2022-02-20 23:45:12,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:45:12,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:45:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:45:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 712 transitions. [2022-02-20 23:45:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:45:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 712 transitions. [2022-02-20 23:45:12,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 712 transitions. [2022-02-20 23:45:13,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 712 edges. 712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:13,359 INFO L225 Difference]: With dead ends: 766 [2022-02-20 23:45:13,360 INFO L226 Difference]: Without dead ends: 766 [2022-02-20 23:45:13,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:45:13,360 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 641 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:13,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [647 Valid, 825 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 23:45:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-02-20 23:45:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 384. [2022-02-20 23:45:13,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:13,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 766 states. Second operand has 384 states, 304 states have (on average 1.7203947368421053) internal successors, (523), 370 states have internal predecessors, (523), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-20 23:45:13,371 INFO L74 IsIncluded]: Start isIncluded. First operand 766 states. Second operand has 384 states, 304 states have (on average 1.7203947368421053) internal successors, (523), 370 states have internal predecessors, (523), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-20 23:45:13,371 INFO L87 Difference]: Start difference. First operand 766 states. Second operand has 384 states, 304 states have (on average 1.7203947368421053) internal successors, (523), 370 states have internal predecessors, (523), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-20 23:45:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:13,398 INFO L93 Difference]: Finished difference Result 766 states and 951 transitions. [2022-02-20 23:45:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 951 transitions. [2022-02-20 23:45:13,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:13,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:13,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 384 states, 304 states have (on average 1.7203947368421053) internal successors, (523), 370 states have internal predecessors, (523), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) Second operand 766 states. [2022-02-20 23:45:13,401 INFO L87 Difference]: Start difference. First operand has 384 states, 304 states have (on average 1.7203947368421053) internal successors, (523), 370 states have internal predecessors, (523), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) Second operand 766 states. [2022-02-20 23:45:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:13,427 INFO L93 Difference]: Finished difference Result 766 states and 951 transitions. [2022-02-20 23:45:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 951 transitions. [2022-02-20 23:45:13,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:13,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:13,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:13,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 304 states have (on average 1.7203947368421053) internal successors, (523), 370 states have internal predecessors, (523), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-20 23:45:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 547 transitions. [2022-02-20 23:45:13,438 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 547 transitions. Word has length 17 [2022-02-20 23:45:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:13,439 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 547 transitions. [2022-02-20 23:45:13,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:45:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 547 transitions. [2022-02-20 23:45:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:45:13,439 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:13,440 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:45:13,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:45:13,440 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:13,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1064604948, now seen corresponding path program 1 times [2022-02-20 23:45:13,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:13,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856703204] [2022-02-20 23:45:13,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:13,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:13,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:13,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {18852#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {18852#true} is VALID [2022-02-20 23:45:13,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {18852#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {18861#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:13,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {18861#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} assume true; {18861#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:13,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18861#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} {18852#true} #310#return; {18858#(<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret32#1|)} is VALID [2022-02-20 23:45:13,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {18852#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(12, 2);~#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); {18852#true} is VALID [2022-02-20 23:45:13,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {18852#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {18852#true} is VALID [2022-02-20 23:45:13,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {18852#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {18852#true} is VALID [2022-02-20 23:45:13,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {18852#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {18852#true} is VALID [2022-02-20 23:45:13,548 INFO L290 TraceCheckUtils]: 4: Hoare triple {18852#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {18852#true} is VALID [2022-02-20 23:45:13,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {18852#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {18852#true} is VALID [2022-02-20 23:45:13,548 INFO L272 TraceCheckUtils]: 6: Hoare triple {18852#true} call main_#t~ret32#1 := rand_end_point(); {18852#true} is VALID [2022-02-20 23:45:13,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {18852#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {18852#true} is VALID [2022-02-20 23:45:13,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {18852#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {18861#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:13,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {18861#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} assume true; {18861#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:13,550 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18861#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} {18852#true} #310#return; {18858#(<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret32#1|)} is VALID [2022-02-20 23:45:13,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {18858#(<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret32#1|)} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {18859#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:45:13,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {18859#(not (= ~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); {18859#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:45:13,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {18859#(not (= ~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; {18860#(not |ULTIMATE.start_create_item_#t~switch6#1|)} is VALID [2022-02-20 23:45:13,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {18860#(not |ULTIMATE.start_create_item_#t~switch6#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; {18853#false} is VALID [2022-02-20 23:45:13,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {18853#false} havoc create_item_#t~switch6#1; {18853#false} is VALID [2022-02-20 23:45:13,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {18853#false} assume !(4 + create_item_~cursor#1.offset <= #length[create_item_~cursor#1.base] && 0 <= create_item_~cursor#1.offset); {18853#false} is VALID [2022-02-20 23:45:13,561 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:45:13,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:13,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856703204] [2022-02-20 23:45:13,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856703204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:13,562 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:13,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:13,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012357862] [2022-02-20 23:45:13,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:13,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:13,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:13,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:13,579 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:45:13,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:13,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:13,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:13,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:13,580 INFO L87 Difference]: Start difference. First operand 384 states and 547 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,220 INFO L93 Difference]: Finished difference Result 614 states and 849 transitions. [2022-02-20 23:45:14,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:14,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:14,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 375 transitions. [2022-02-20 23:45:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 375 transitions. [2022-02-20 23:45:14,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 375 transitions. [2022-02-20 23:45:14,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 375 edges. 375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:14,508 INFO L225 Difference]: With dead ends: 614 [2022-02-20 23:45:14,508 INFO L226 Difference]: Without dead ends: 614 [2022-02-20 23:45:14,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:14,508 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 243 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:14,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 1549 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-02-20 23:45:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 394. [2022-02-20 23:45:14,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:14,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 614 states. Second operand has 394 states, 311 states have (on average 1.7009646302250805) internal successors, (529), 379 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:14,518 INFO L74 IsIncluded]: Start isIncluded. First operand 614 states. Second operand has 394 states, 311 states have (on average 1.7009646302250805) internal successors, (529), 379 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:14,518 INFO L87 Difference]: Start difference. First operand 614 states. Second operand has 394 states, 311 states have (on average 1.7009646302250805) internal successors, (529), 379 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,537 INFO L93 Difference]: Finished difference Result 614 states and 849 transitions. [2022-02-20 23:45:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 849 transitions. [2022-02-20 23:45:14,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:14,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:14,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 394 states, 311 states have (on average 1.7009646302250805) internal successors, (529), 379 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) Second operand 614 states. [2022-02-20 23:45:14,540 INFO L87 Difference]: Start difference. First operand has 394 states, 311 states have (on average 1.7009646302250805) internal successors, (529), 379 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) Second operand 614 states. [2022-02-20 23:45:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,559 INFO L93 Difference]: Finished difference Result 614 states and 849 transitions. [2022-02-20 23:45:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 849 transitions. [2022-02-20 23:45:14,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:14,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:14,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:14,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 311 states have (on average 1.7009646302250805) internal successors, (529), 379 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 559 transitions. [2022-02-20 23:45:14,571 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 559 transitions. Word has length 17 [2022-02-20 23:45:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:14,571 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 559 transitions. [2022-02-20 23:45:14,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 559 transitions. [2022-02-20 23:45:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:45:14,572 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:14,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:14,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:45:14,572 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:14,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1357040557, now seen corresponding path program 1 times [2022-02-20 23:45:14,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:14,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153685825] [2022-02-20 23:45:14,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:14,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:14,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:14,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {21104#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {21104#true} is VALID [2022-02-20 23:45:14,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {21104#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {21113#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:14,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {21113#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {21113#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:14,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21113#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #310#return; {21111#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (* ~unnamed1~0~LIST_END 4)) (<= (* ~unnamed1~0~LIST_END 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))))} is VALID [2022-02-20 23:45:14,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {21104#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(12, 2);~#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); {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,688 INFO L272 TraceCheckUtils]: 6: Hoare triple {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret32#1 := rand_end_point(); {21104#true} is VALID [2022-02-20 23:45:14,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {21104#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {21104#true} is VALID [2022-02-20 23:45:14,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {21104#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {21113#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:14,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {21113#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {21113#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:14,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21113#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {21106#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #310#return; {21111#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (* ~unnamed1~0~LIST_END 4)) (<= (* ~unnamed1~0~LIST_END 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))))} is VALID [2022-02-20 23:45:14,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {21111#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (* ~unnamed1~0~LIST_END 4)) (<= (* ~unnamed1~0~LIST_END 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {21112#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:14,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {21112#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {21112#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:14,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {21112#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#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; {21112#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:14,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {21112#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} assume !create_item_#t~switch6#1;create_item_#t~switch6#1 := create_item_#t~switch6#1 || create_item_~at#1 == ~unnamed1~0~LIST_END; {21112#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:14,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {21112#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} 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; {21112#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:14,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {21112#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} havoc create_item_#t~switch6#1; {21112#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:14,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {21112#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} assume !(4 + create_item_~cursor#1.offset <= #length[create_item_~cursor#1.base] && 0 <= create_item_~cursor#1.offset); {21105#false} is VALID [2022-02-20 23:45:14,696 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:45:14,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:14,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153685825] [2022-02-20 23:45:14,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153685825] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:14,697 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:14,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:14,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525386867] [2022-02-20 23:45:14,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:14,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 18 [2022-02-20 23:45:14,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:14,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:45:14,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:14,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:14,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:14,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:14,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:14,714 INFO L87 Difference]: Start difference. First operand 394 states and 559 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:45:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:16,571 INFO L93 Difference]: Finished difference Result 793 states and 993 transitions. [2022-02-20 23:45:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:45:16,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 18 [2022-02-20 23:45:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:45:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 711 transitions. [2022-02-20 23:45:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:45:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 711 transitions. [2022-02-20 23:45:16,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 711 transitions. [2022-02-20 23:45:17,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 711 edges. 711 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:17,124 INFO L225 Difference]: With dead ends: 793 [2022-02-20 23:45:17,124 INFO L226 Difference]: Without dead ends: 793 [2022-02-20 23:45:17,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:17,125 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 548 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:17,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [550 Valid, 839 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:45:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2022-02-20 23:45:17,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 391. [2022-02-20 23:45:17,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:17,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 793 states. Second operand has 391 states, 308 states have (on average 1.7012987012987013) internal successors, (524), 376 states have internal predecessors, (524), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:17,146 INFO L74 IsIncluded]: Start isIncluded. First operand 793 states. Second operand has 391 states, 308 states have (on average 1.7012987012987013) internal successors, (524), 376 states have internal predecessors, (524), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:17,147 INFO L87 Difference]: Start difference. First operand 793 states. Second operand has 391 states, 308 states have (on average 1.7012987012987013) internal successors, (524), 376 states have internal predecessors, (524), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,180 INFO L93 Difference]: Finished difference Result 793 states and 993 transitions. [2022-02-20 23:45:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 993 transitions. [2022-02-20 23:45:17,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:17,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:17,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 308 states have (on average 1.7012987012987013) internal successors, (524), 376 states have internal predecessors, (524), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) Second operand 793 states. [2022-02-20 23:45:17,185 INFO L87 Difference]: Start difference. First operand has 391 states, 308 states have (on average 1.7012987012987013) internal successors, (524), 376 states have internal predecessors, (524), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) Second operand 793 states. [2022-02-20 23:45:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,216 INFO L93 Difference]: Finished difference Result 793 states and 993 transitions. [2022-02-20 23:45:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 993 transitions. [2022-02-20 23:45:17,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:17,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:17,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:17,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 308 states have (on average 1.7012987012987013) internal successors, (524), 376 states have internal predecessors, (524), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 554 transitions. [2022-02-20 23:45:17,230 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 554 transitions. Word has length 18 [2022-02-20 23:45:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:17,230 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 554 transitions. [2022-02-20 23:45:17,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:45:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 554 transitions. [2022-02-20 23:45:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:45:17,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:17,233 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:45:17,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:45:17,233 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:17,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1279047357, now seen corresponding path program 1 times [2022-02-20 23:45:17,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:17,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10305165] [2022-02-20 23:45:17,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:17,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:17,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {23894#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {23894#true} is VALID [2022-02-20 23:45:17,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {23894#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {23894#true} is VALID [2022-02-20 23:45:17,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {23894#true} assume true; {23894#true} is VALID [2022-02-20 23:45:17,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23894#true} {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} #312#return; {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:17,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {23894#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(12, 2);~#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); {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:17,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:17,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:17,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:17,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:17,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:17,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:17,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:17,598 INFO L272 TraceCheckUtils]: 8: Hoare triple {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} call main_#t~ret34#1 := rand_end_point(); {23894#true} is VALID [2022-02-20 23:45:17,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {23894#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {23894#true} is VALID [2022-02-20 23:45:17,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {23894#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {23894#true} is VALID [2022-02-20 23:45:17,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {23894#true} assume true; {23894#true} is VALID [2022-02-20 23:45:17,600 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {23894#true} {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} #312#return; {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:17,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {23896#(and (= (select (select |#memory_$Pointer$.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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {23901#(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) (= (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)) (not (= |ULTIMATE.start_is_empty_~list#1.offset| 0)))} is VALID [2022-02-20 23:45:17,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {23901#(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) (= (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)) (not (= |ULTIMATE.start_is_empty_~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: L659 {23902#(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|) (+ (* ~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|)) (not (= |ULTIMATE.start_is_empty_~list#1.offset| 0)))} is VALID [2022-02-20 23:45:17,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {23902#(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|) (+ (* ~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|)) (not (= |ULTIMATE.start_is_empty_~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; {23903#(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|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (not (= |ULTIMATE.start_is_empty_~list#1.offset| 0)))} is VALID [2022-02-20 23:45:17,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {23903#(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|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (not (= |ULTIMATE.start_is_empty_~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: L660 {23904#(or (and (= |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)) (not (= |ULTIMATE.start_is_empty_~list#1.offset| 0)))} is VALID [2022-02-20 23:45:17,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {23904#(or (and (= |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)) (not (= |ULTIMATE.start_is_empty_~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; {23905#(or (= |ULTIMATE.start_is_empty_~no_end~0#1| |ULTIMATE.start_is_empty_~no_beg~0#1|) (not (= |ULTIMATE.start_is_empty_~list#1.offset| 0)))} is VALID [2022-02-20 23:45:17,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {23905#(or (= |ULTIMATE.start_is_empty_~no_end~0#1| |ULTIMATE.start_is_empty_~no_beg~0#1|) (not (= |ULTIMATE.start_is_empty_~list#1.offset| 0)))} assume is_empty_~no_beg~0#1 != is_empty_~no_end~0#1; {23906#(not (= |ULTIMATE.start_is_empty_~list#1.offset| 0))} is VALID [2022-02-20 23:45:17,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {23906#(not (= |ULTIMATE.start_is_empty_~list#1.offset| 0))} assume 0 == is_empty_~list#1.offset; {23895#false} is VALID [2022-02-20 23:45:17,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {23895#false} assume !(is_empty_~list#1.base < #StackHeapBarrier); {23895#false} is VALID [2022-02-20 23:45:17,608 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:45:17,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:17,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10305165] [2022-02-20 23:45:17,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10305165] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:17,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:17,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:45:17,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244511513] [2022-02-20 23:45:17,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:17,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:45:17,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:17,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:45:17,626 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:45:17,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:45:17,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:17,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:45:17,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:45:17,627 INFO L87 Difference]: Start difference. First operand 391 states and 554 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:45:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:19,656 INFO L93 Difference]: Finished difference Result 813 states and 1121 transitions. [2022-02-20 23:45:19,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:45:19,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:45:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:45:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 516 transitions. [2022-02-20 23:45:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:45:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 516 transitions. [2022-02-20 23:45:19,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 516 transitions. [2022-02-20 23:45:20,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 516 edges. 516 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:20,107 INFO L225 Difference]: With dead ends: 813 [2022-02-20 23:45:20,107 INFO L226 Difference]: Without dead ends: 811 [2022-02-20 23:45:20,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:45:20,108 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 568 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:20,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [570 Valid, 1604 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:45:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-02-20 23:45:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 385. [2022-02-20 23:45:20,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:20,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 811 states. Second operand has 385 states, 302 states have (on average 1.6986754966887416) internal successors, (513), 370 states have internal predecessors, (513), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:20,118 INFO L74 IsIncluded]: Start isIncluded. First operand 811 states. Second operand has 385 states, 302 states have (on average 1.6986754966887416) internal successors, (513), 370 states have internal predecessors, (513), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:20,118 INFO L87 Difference]: Start difference. First operand 811 states. Second operand has 385 states, 302 states have (on average 1.6986754966887416) internal successors, (513), 370 states have internal predecessors, (513), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:20,149 INFO L93 Difference]: Finished difference Result 811 states and 1119 transitions. [2022-02-20 23:45:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1119 transitions. [2022-02-20 23:45:20,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:20,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:20,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 302 states have (on average 1.6986754966887416) internal successors, (513), 370 states have internal predecessors, (513), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) Second operand 811 states. [2022-02-20 23:45:20,152 INFO L87 Difference]: Start difference. First operand has 385 states, 302 states have (on average 1.6986754966887416) internal successors, (513), 370 states have internal predecessors, (513), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) Second operand 811 states. [2022-02-20 23:45:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:20,180 INFO L93 Difference]: Finished difference Result 811 states and 1119 transitions. [2022-02-20 23:45:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1119 transitions. [2022-02-20 23:45:20,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:20,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:20,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:20,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 302 states have (on average 1.6986754966887416) internal successors, (513), 370 states have internal predecessors, (513), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 543 transitions. [2022-02-20 23:45:20,190 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 543 transitions. Word has length 21 [2022-02-20 23:45:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:20,190 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 543 transitions. [2022-02-20 23:45:20,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:45:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 543 transitions. [2022-02-20 23:45:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:45:20,190 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:20,190 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:45:20,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:45:20,191 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:20,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2000662896, now seen corresponding path program 1 times [2022-02-20 23:45:20,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:20,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300452695] [2022-02-20 23:45:20,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:20,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:20,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:20,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {26741#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {26741#true} is VALID [2022-02-20 23:45:20,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {26741#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {26741#true} is VALID [2022-02-20 23:45:20,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {26741#true} assume true; {26741#true} is VALID [2022-02-20 23:45:20,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26741#true} {26743#(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))} #310#return; {26743#(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:45:20,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {26741#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(12, 2);~#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); {26743#(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:45:20,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {26743#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {26743#(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:45:20,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {26743#(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~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {26743#(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:45:20,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {26743#(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 !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {26743#(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:45:20,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {26743#(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~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {26743#(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:45:20,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {26743#(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 !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {26743#(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:45:20,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {26743#(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~ret32#1 := rand_end_point(); {26741#true} is VALID [2022-02-20 23:45:20,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {26741#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {26741#true} is VALID [2022-02-20 23:45:20,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {26741#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {26741#true} is VALID [2022-02-20 23:45:20,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {26741#true} assume true; {26741#true} is VALID [2022-02-20 23:45:20,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26741#true} {26743#(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))} #310#return; {26743#(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:45:20,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {26743#(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~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {26748#(and (or (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (or (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (not (= |ULTIMATE.start_create_item_~at#1| 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)) (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0))))} is VALID [2022-02-20 23:45:20,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {26748#(and (or (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (or (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (not (= |ULTIMATE.start_create_item_~at#1| 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)) (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0))))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {26748#(and (or (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (or (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (not (= |ULTIMATE.start_create_item_~at#1| 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)) (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0))))} is VALID [2022-02-20 23:45:20,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {26748#(and (or (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (or (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (not (= |ULTIMATE.start_create_item_~at#1| 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)) (not (= |ULTIMATE.start_create_item_~cursor#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; {26749#(or (not |ULTIMATE.start_create_item_#t~switch6#1|) (and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)))))} is VALID [2022-02-20 23:45:20,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {26749#(or (not |ULTIMATE.start_create_item_#t~switch6#1|) (and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#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; {26750#(and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))))} is VALID [2022-02-20 23:45:20,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {26750#(and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))))} havoc create_item_#t~switch6#1; {26750#(and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))))} is VALID [2022-02-20 23:45:20,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {26750#(and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {26751#(and (= |ULTIMATE.start_create_item_#t~mem8#1.base| 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem8#1.offset| 0))} is VALID [2022-02-20 23:45:20,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {26751#(and (= |ULTIMATE.start_create_item_#t~mem8#1.base| 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem8#1.offset| 0))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {26752#(and (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (not |ULTIMATE.start_create_item_#t~short10#1|))} is VALID [2022-02-20 23:45:20,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {26752#(and (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (not |ULTIMATE.start_create_item_#t~short10#1|))} assume create_item_#t~short10#1; {26742#false} is VALID [2022-02-20 23:45:20,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {26742#false} SUMMARY for call create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-3 {26742#false} is VALID [2022-02-20 23:45:20,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {26742#false} assume !(1 == #valid[create_item_#t~mem7#1.base]); {26742#false} is VALID [2022-02-20 23:45:20,453 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:45:20,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:20,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300452695] [2022-02-20 23:45:20,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300452695] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:20,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:20,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:45:20,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683274032] [2022-02-20 23:45:20,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:20,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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:45:20,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:20,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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:45:20,471 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:45:20,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:45:20,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:20,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:45:20,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:20,473 INFO L87 Difference]: Start difference. First operand 385 states and 543 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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:45:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:21,502 INFO L93 Difference]: Finished difference Result 548 states and 728 transitions. [2022-02-20 23:45:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:45:21,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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:45:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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:45:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 352 transitions. [2022-02-20 23:45:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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:45:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 352 transitions. [2022-02-20 23:45:21,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 352 transitions. [2022-02-20 23:45:21,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:21,770 INFO L225 Difference]: With dead ends: 548 [2022-02-20 23:45:21,770 INFO L226 Difference]: Without dead ends: 548 [2022-02-20 23:45:21,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:45:21,771 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 217 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:21,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 951 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-02-20 23:45:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 401. [2022-02-20 23:45:21,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:21,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 548 states. Second operand has 401 states, 318 states have (on average 1.6761006289308176) internal successors, (533), 384 states have internal predecessors, (533), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:21,779 INFO L74 IsIncluded]: Start isIncluded. First operand 548 states. Second operand has 401 states, 318 states have (on average 1.6761006289308176) internal successors, (533), 384 states have internal predecessors, (533), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:21,779 INFO L87 Difference]: Start difference. First operand 548 states. Second operand has 401 states, 318 states have (on average 1.6761006289308176) internal successors, (533), 384 states have internal predecessors, (533), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:21,793 INFO L93 Difference]: Finished difference Result 548 states and 728 transitions. [2022-02-20 23:45:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 728 transitions. [2022-02-20 23:45:21,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:21,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:21,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 318 states have (on average 1.6761006289308176) internal successors, (533), 384 states have internal predecessors, (533), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Second operand 548 states. [2022-02-20 23:45:21,795 INFO L87 Difference]: Start difference. First operand has 401 states, 318 states have (on average 1.6761006289308176) internal successors, (533), 384 states have internal predecessors, (533), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Second operand 548 states. [2022-02-20 23:45:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:21,809 INFO L93 Difference]: Finished difference Result 548 states and 728 transitions. [2022-02-20 23:45:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 728 transitions. [2022-02-20 23:45:21,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:21,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:21,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:21,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 318 states have (on average 1.6761006289308176) internal successors, (533), 384 states have internal predecessors, (533), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 563 transitions. [2022-02-20 23:45:21,817 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 563 transitions. Word has length 21 [2022-02-20 23:45:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:21,817 INFO L470 AbstractCegarLoop]: Abstraction has 401 states and 563 transitions. [2022-02-20 23:45:21,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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:45:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 563 transitions. [2022-02-20 23:45:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:45:21,818 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:21,819 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] [2022-02-20 23:45:21,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:45:21,819 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:21,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1680606867, now seen corresponding path program 1 times [2022-02-20 23:45:21,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:21,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669391636] [2022-02-20 23:45:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:21,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:21,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {28810#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {28810#true} is VALID [2022-02-20 23:45:21,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {28810#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {28819#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:21,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {28819#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {28819#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:21,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28819#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {28810#true} #310#return; {28816#(<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:21,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {28810#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(12, 2);~#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); {28810#true} is VALID [2022-02-20 23:45:21,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {28810#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {28810#true} is VALID [2022-02-20 23:45:21,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {28810#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {28810#true} is VALID [2022-02-20 23:45:21,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {28810#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {28810#true} is VALID [2022-02-20 23:45:21,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {28810#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {28810#true} is VALID [2022-02-20 23:45:21,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {28810#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {28810#true} is VALID [2022-02-20 23:45:21,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {28810#true} call main_#t~ret32#1 := rand_end_point(); {28810#true} is VALID [2022-02-20 23:45:21,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {28810#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {28810#true} is VALID [2022-02-20 23:45:21,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {28810#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {28819#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:21,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {28819#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {28819#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:21,927 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28819#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {28810#true} #310#return; {28816#(<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:21,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {28816#(<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG)} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {28817#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:45:21,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {28817#(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); {28817#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:45:21,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {28817#(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; {28817#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:45:21,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {28817#(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; {28818#(not |ULTIMATE.start_create_item_#t~switch6#1|)} is VALID [2022-02-20 23:45:21,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {28818#(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; {28811#false} is VALID [2022-02-20 23:45:21,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {28811#false} havoc create_item_#t~switch6#1; {28811#false} is VALID [2022-02-20 23:45:21,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {28811#false} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {28811#false} is VALID [2022-02-20 23:45:21,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {28811#false} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {28811#false} is VALID [2022-02-20 23:45:21,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {28811#false} assume create_item_#t~short10#1; {28811#false} is VALID [2022-02-20 23:45:21,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {28811#false} SUMMARY for call create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-3 {28811#false} is VALID [2022-02-20 23:45:21,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {28811#false} assume !(1 == #valid[create_item_#t~mem7#1.base]); {28811#false} is VALID [2022-02-20 23:45:21,931 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:45:21,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:21,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669391636] [2022-02-20 23:45:21,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669391636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:21,931 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:21,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:21,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848936818] [2022-02-20 23:45:21,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:21,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2022-02-20 23:45:21,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:21,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:45:21,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:21,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:21,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:21,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:21,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:21,948 INFO L87 Difference]: Start difference. First operand 401 states and 563 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:45:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:22,464 INFO L93 Difference]: Finished difference Result 646 states and 894 transitions. [2022-02-20 23:45:22,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:22,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2022-02-20 23:45:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:45:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 374 transitions. [2022-02-20 23:45:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:45:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 374 transitions. [2022-02-20 23:45:22,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 374 transitions. [2022-02-20 23:45:22,700 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:45:22,712 INFO L225 Difference]: With dead ends: 646 [2022-02-20 23:45:22,712 INFO L226 Difference]: Without dead ends: 646 [2022-02-20 23:45:22,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:22,712 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 245 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:22,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 1239 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-02-20 23:45:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 403. [2022-02-20 23:45:22,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:22,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 646 states. Second operand has 403 states, 320 states have (on average 1.671875) internal successors, (535), 386 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:22,721 INFO L74 IsIncluded]: Start isIncluded. First operand 646 states. Second operand has 403 states, 320 states have (on average 1.671875) internal successors, (535), 386 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:22,721 INFO L87 Difference]: Start difference. First operand 646 states. Second operand has 403 states, 320 states have (on average 1.671875) internal successors, (535), 386 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:22,740 INFO L93 Difference]: Finished difference Result 646 states and 894 transitions. [2022-02-20 23:45:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 894 transitions. [2022-02-20 23:45:22,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:22,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:22,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 403 states, 320 states have (on average 1.671875) internal successors, (535), 386 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Second operand 646 states. [2022-02-20 23:45:22,743 INFO L87 Difference]: Start difference. First operand has 403 states, 320 states have (on average 1.671875) internal successors, (535), 386 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Second operand 646 states. [2022-02-20 23:45:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:22,757 INFO L93 Difference]: Finished difference Result 646 states and 894 transitions. [2022-02-20 23:45:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 894 transitions. [2022-02-20 23:45:22,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:22,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:22,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:22,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 320 states have (on average 1.671875) internal successors, (535), 386 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 565 transitions. [2022-02-20 23:45:22,767 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 565 transitions. Word has length 22 [2022-02-20 23:45:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:22,767 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 565 transitions. [2022-02-20 23:45:22,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:45:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 565 transitions. [2022-02-20 23:45:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:45:22,768 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:22,768 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] [2022-02-20 23:45:22,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:45:22,768 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:22,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:22,769 INFO L85 PathProgramCache]: Analyzing trace with hash -839353067, now seen corresponding path program 1 times [2022-02-20 23:45:22,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:22,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405062792] [2022-02-20 23:45:22,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:22,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:22,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {31167#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {31167#true} is VALID [2022-02-20 23:45:22,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {31167#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {31176#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:22,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {31176#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {31176#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:22,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31176#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {31167#true} #310#return; {31173#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret32#1|) (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:22,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {31167#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(12, 2);~#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); {31167#true} is VALID [2022-02-20 23:45:22,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {31167#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {31167#true} is VALID [2022-02-20 23:45:22,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {31167#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {31167#true} is VALID [2022-02-20 23:45:22,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {31167#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {31167#true} is VALID [2022-02-20 23:45:22,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {31167#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {31167#true} is VALID [2022-02-20 23:45:22,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {31167#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {31167#true} is VALID [2022-02-20 23:45:22,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {31167#true} call main_#t~ret32#1 := rand_end_point(); {31167#true} is VALID [2022-02-20 23:45:22,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {31167#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {31167#true} is VALID [2022-02-20 23:45:22,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {31167#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {31176#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:22,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {31176#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {31176#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:22,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31176#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {31167#true} #310#return; {31173#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret32#1|) (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:22,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {31173#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret32#1|) (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {31174#(= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:45:22,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {31174#(= ~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); {31174#(= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:45:22,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {31174#(= ~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; {31175#|ULTIMATE.start_create_item_#t~switch6#1|} is VALID [2022-02-20 23:45:22,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {31175#|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; {31168#false} is VALID [2022-02-20 23:45:22,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {31168#false} assume !create_item_#t~switch6#1; {31168#false} is VALID [2022-02-20 23:45:22,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {31168#false} havoc create_item_#t~switch6#1; {31168#false} is VALID [2022-02-20 23:45:22,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {31168#false} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {31168#false} is VALID [2022-02-20 23:45:22,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {31168#false} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {31168#false} is VALID [2022-02-20 23:45:22,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {31168#false} assume create_item_#t~short10#1; {31168#false} is VALID [2022-02-20 23:45:22,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {31168#false} SUMMARY for call create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-3 {31168#false} is VALID [2022-02-20 23:45:22,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {31168#false} assume !(1 == #valid[create_item_#t~mem7#1.base]); {31168#false} is VALID [2022-02-20 23:45:22,850 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:45:22,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:22,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405062792] [2022-02-20 23:45:22,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405062792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:22,850 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:22,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:22,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326063940] [2022-02-20 23:45:22,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:22,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2022-02-20 23:45:22,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:22,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:45:22,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:22,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:22,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:22,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:22,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:22,867 INFO L87 Difference]: Start difference. First operand 403 states and 565 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:45:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:23,487 INFO L93 Difference]: Finished difference Result 642 states and 886 transitions. [2022-02-20 23:45:23,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:23,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2022-02-20 23:45:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:45:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 371 transitions. [2022-02-20 23:45:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:45:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 371 transitions. [2022-02-20 23:45:23,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 371 transitions. [2022-02-20 23:45:23,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:23,744 INFO L225 Difference]: With dead ends: 642 [2022-02-20 23:45:23,744 INFO L226 Difference]: Without dead ends: 642 [2022-02-20 23:45:23,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:23,744 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 242 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:23,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 1255 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-02-20 23:45:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 401. [2022-02-20 23:45:23,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:23,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 642 states. Second operand has 401 states, 318 states have (on average 1.6635220125786163) internal successors, (529), 384 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:23,752 INFO L74 IsIncluded]: Start isIncluded. First operand 642 states. Second operand has 401 states, 318 states have (on average 1.6635220125786163) internal successors, (529), 384 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:23,753 INFO L87 Difference]: Start difference. First operand 642 states. Second operand has 401 states, 318 states have (on average 1.6635220125786163) internal successors, (529), 384 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:23,766 INFO L93 Difference]: Finished difference Result 642 states and 886 transitions. [2022-02-20 23:45:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 886 transitions. [2022-02-20 23:45:23,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:23,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:23,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 318 states have (on average 1.6635220125786163) internal successors, (529), 384 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Second operand 642 states. [2022-02-20 23:45:23,768 INFO L87 Difference]: Start difference. First operand has 401 states, 318 states have (on average 1.6635220125786163) internal successors, (529), 384 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Second operand 642 states. [2022-02-20 23:45:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:23,788 INFO L93 Difference]: Finished difference Result 642 states and 886 transitions. [2022-02-20 23:45:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 886 transitions. [2022-02-20 23:45:23,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:23,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:23,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:23,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 318 states have (on average 1.6635220125786163) internal successors, (529), 384 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 559 transitions. [2022-02-20 23:45:23,800 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 559 transitions. Word has length 22 [2022-02-20 23:45:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:23,800 INFO L470 AbstractCegarLoop]: Abstraction has 401 states and 559 transitions. [2022-02-20 23:45:23,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:45:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 559 transitions. [2022-02-20 23:45:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:45:23,801 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:23,801 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] [2022-02-20 23:45:23,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:45:23,802 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:23,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:23,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1175048242, now seen corresponding path program 1 times [2022-02-20 23:45:23,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:23,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208243607] [2022-02-20 23:45:23,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:23,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:23,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:23,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {33510#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {33510#true} is VALID [2022-02-20 23:45:23,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {33510#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {33521#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:23,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {33521#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {33521#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:23,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33521#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {33512#(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))))} #310#return; {33517#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset|) (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (<= (* 4 |ULTIMATE.start_main_#t~ret32#1|) (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:23,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {33510#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(12, 2);~#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); {33512#(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))))} is VALID [2022-02-20 23:45:23,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {33512#(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))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {33512#(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))))} is VALID [2022-02-20 23:45:23,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {33512#(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))))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {33512#(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))))} is VALID [2022-02-20 23:45:23,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {33512#(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))))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {33512#(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))))} is VALID [2022-02-20 23:45:23,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {33512#(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))))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {33512#(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))))} is VALID [2022-02-20 23:45:23,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {33512#(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))))} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {33512#(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))))} is VALID [2022-02-20 23:45:23,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {33512#(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))))} call main_#t~ret32#1 := rand_end_point(); {33510#true} is VALID [2022-02-20 23:45:23,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {33510#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {33510#true} is VALID [2022-02-20 23:45:23,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {33510#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {33521#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:23,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {33521#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {33521#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:23,931 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33521#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {33512#(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))))} #310#return; {33517#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset|) (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (<= (* 4 |ULTIMATE.start_main_#t~ret32#1|) (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:23,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {33517#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset|) (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (<= (* 4 |ULTIMATE.start_main_#t~ret32#1|) (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {33518#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} is VALID [2022-02-20 23:45:23,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {33518#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {33518#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} is VALID [2022-02-20 23:45:23,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {33518#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#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; {33518#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} is VALID [2022-02-20 23:45:23,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {33518#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} assume !create_item_#t~switch6#1;create_item_#t~switch6#1 := create_item_#t~switch6#1 || create_item_~at#1 == ~unnamed1~0~LIST_END; {33518#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} is VALID [2022-02-20 23:45:23,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {33518#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} 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; {33518#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} is VALID [2022-02-20 23:45:23,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {33518#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} havoc create_item_#t~switch6#1; {33518#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} is VALID [2022-02-20 23:45:23,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {33518#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {33519#(and (= |ULTIMATE.start_create_item_#t~mem8#1.base| 0) (= |ULTIMATE.start_create_item_#t~mem8#1.offset| 0))} is VALID [2022-02-20 23:45:23,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {33519#(and (= |ULTIMATE.start_create_item_#t~mem8#1.base| 0) (= |ULTIMATE.start_create_item_#t~mem8#1.offset| 0))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {33520#(not |ULTIMATE.start_create_item_#t~short10#1|)} is VALID [2022-02-20 23:45:23,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {33520#(not |ULTIMATE.start_create_item_#t~short10#1|)} assume create_item_#t~short10#1; {33511#false} is VALID [2022-02-20 23:45:23,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {33511#false} SUMMARY for call create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-3 {33511#false} is VALID [2022-02-20 23:45:23,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {33511#false} assume !(1 == #valid[create_item_#t~mem7#1.base]); {33511#false} is VALID [2022-02-20 23:45:23,938 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:45:23,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:23,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208243607] [2022-02-20 23:45:23,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208243607] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:23,939 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:23,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:45:23,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92179669] [2022-02-20 23:45:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:23,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2022-02-20 23:45:23,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:23,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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:45:23,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:23,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:45:23,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:45:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:23,958 INFO L87 Difference]: Start difference. First operand 401 states and 559 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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:45:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,172 INFO L93 Difference]: Finished difference Result 578 states and 779 transitions. [2022-02-20 23:45:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:45:25,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2022-02-20 23:45:25,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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:45:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 374 transitions. [2022-02-20 23:45:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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:45:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 374 transitions. [2022-02-20 23:45:25,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 374 transitions. [2022-02-20 23:45:25,459 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:45:25,469 INFO L225 Difference]: With dead ends: 578 [2022-02-20 23:45:25,469 INFO L226 Difference]: Without dead ends: 578 [2022-02-20 23:45:25,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:45:25,470 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 191 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:25,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 1270 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-02-20 23:45:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 411. [2022-02-20 23:45:25,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:25,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 578 states. Second operand has 411 states, 328 states have (on average 1.649390243902439) internal successors, (541), 392 states have internal predecessors, (541), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:25,478 INFO L74 IsIncluded]: Start isIncluded. First operand 578 states. Second operand has 411 states, 328 states have (on average 1.649390243902439) internal successors, (541), 392 states have internal predecessors, (541), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:25,479 INFO L87 Difference]: Start difference. First operand 578 states. Second operand has 411 states, 328 states have (on average 1.649390243902439) internal successors, (541), 392 states have internal predecessors, (541), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,495 INFO L93 Difference]: Finished difference Result 578 states and 779 transitions. [2022-02-20 23:45:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 779 transitions. [2022-02-20 23:45:25,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:25,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:25,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 411 states, 328 states have (on average 1.649390243902439) internal successors, (541), 392 states have internal predecessors, (541), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 578 states. [2022-02-20 23:45:25,497 INFO L87 Difference]: Start difference. First operand has 411 states, 328 states have (on average 1.649390243902439) internal successors, (541), 392 states have internal predecessors, (541), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 578 states. [2022-02-20 23:45:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,519 INFO L93 Difference]: Finished difference Result 578 states and 779 transitions. [2022-02-20 23:45:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 779 transitions. [2022-02-20 23:45:25,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:25,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:25,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:25,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 328 states have (on average 1.649390243902439) internal successors, (541), 392 states have internal predecessors, (541), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 571 transitions. [2022-02-20 23:45:25,530 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 571 transitions. Word has length 22 [2022-02-20 23:45:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:25,531 INFO L470 AbstractCegarLoop]: Abstraction has 411 states and 571 transitions. [2022-02-20 23:45:25,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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:45:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 571 transitions. [2022-02-20 23:45:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:45:25,531 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:25,532 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:45:25,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:45:25,532 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:25,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:25,533 INFO L85 PathProgramCache]: Analyzing trace with hash -796222002, now seen corresponding path program 1 times [2022-02-20 23:45:25,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:25,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079480807] [2022-02-20 23:45:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:25,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:25,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:25,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {35681#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {35681#true} is VALID [2022-02-20 23:45:25,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {35681#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {35681#true} is VALID [2022-02-20 23:45:25,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {35681#true} assume true; {35681#true} is VALID [2022-02-20 23:45:25,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35681#true} {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #312#return; {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:25,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {35681#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(12, 2);~#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); {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:25,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {35683#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:25,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:25,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:25,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:25,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:25,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:25,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:25,581 INFO L272 TraceCheckUtils]: 8: Hoare triple {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret34#1 := rand_end_point(); {35681#true} is VALID [2022-02-20 23:45:25,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {35681#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {35681#true} is VALID [2022-02-20 23:45:25,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {35681#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {35681#true} is VALID [2022-02-20 23:45:25,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {35681#true} assume true; {35681#true} is VALID [2022-02-20 23:45:25,582 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35681#true} {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #312#return; {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:25,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {35683#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {35688#(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:45:25,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {35688#(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: L659 {35688#(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:45:25,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {35688#(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; {35688#(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:45:25,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {35688#(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: L660 {35688#(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:45:25,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {35688#(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; {35688#(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:45:25,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {35688#(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); {35688#(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:45:25,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {35688#(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; {35688#(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:45:25,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {35688#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {35688#(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:45:25,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {35688#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {35688#(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:45:25,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {35688#(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]); {35682#false} is VALID [2022-02-20 23:45:25,591 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:45:25,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:25,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079480807] [2022-02-20 23:45:25,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079480807] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:25,592 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:25,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:25,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137974817] [2022-02-20 23:45:25,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:25,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:25,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:25,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:25,610 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:45:25,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:25,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:25,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:25,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:25,611 INFO L87 Difference]: Start difference. First operand 411 states and 571 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:26,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:26,171 INFO L93 Difference]: Finished difference Result 654 states and 844 transitions. [2022-02-20 23:45:26,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:26,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2022-02-20 23:45:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2022-02-20 23:45:26,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 467 transitions. [2022-02-20 23:45:26,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:26,560 INFO L225 Difference]: With dead ends: 654 [2022-02-20 23:45:26,560 INFO L226 Difference]: Without dead ends: 654 [2022-02-20 23:45:26,560 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:45:26,561 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 303 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:26,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 442 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-02-20 23:45:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 439. [2022-02-20 23:45:26,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:26,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 654 states. Second operand has 439 states, 356 states have (on average 1.6657303370786516) internal successors, (593), 420 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:26,574 INFO L74 IsIncluded]: Start isIncluded. First operand 654 states. Second operand has 439 states, 356 states have (on average 1.6657303370786516) internal successors, (593), 420 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:26,574 INFO L87 Difference]: Start difference. First operand 654 states. Second operand has 439 states, 356 states have (on average 1.6657303370786516) internal successors, (593), 420 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:26,594 INFO L93 Difference]: Finished difference Result 654 states and 844 transitions. [2022-02-20 23:45:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 844 transitions. [2022-02-20 23:45:26,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:26,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:26,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 439 states, 356 states have (on average 1.6657303370786516) internal successors, (593), 420 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 654 states. [2022-02-20 23:45:26,596 INFO L87 Difference]: Start difference. First operand has 439 states, 356 states have (on average 1.6657303370786516) internal successors, (593), 420 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 654 states. [2022-02-20 23:45:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:26,616 INFO L93 Difference]: Finished difference Result 654 states and 844 transitions. [2022-02-20 23:45:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 844 transitions. [2022-02-20 23:45:26,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:26,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:26,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:26,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 356 states have (on average 1.6657303370786516) internal successors, (593), 420 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 623 transitions. [2022-02-20 23:45:26,630 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 623 transitions. Word has length 23 [2022-02-20 23:45:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:26,630 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 623 transitions. [2022-02-20 23:45:26,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 623 transitions. [2022-02-20 23:45:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:45:26,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:26,631 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:45:26,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:45:26,631 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash -796222001, now seen corresponding path program 1 times [2022-02-20 23:45:26,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:26,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740925256] [2022-02-20 23:45:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:26,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:26,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {38094#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {38094#true} is VALID [2022-02-20 23:45:26,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {38094#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {38094#true} is VALID [2022-02-20 23:45:26,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {38094#true} assume true; {38094#true} is VALID [2022-02-20 23:45:26,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38094#true} {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #312#return; {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:26,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {38094#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(12, 2);~#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); {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:26,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {38096#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:26,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:26,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:26,773 INFO L290 TraceCheckUtils]: 4: Hoare triple {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:26,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:26,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:26,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:26,774 INFO L272 TraceCheckUtils]: 8: Hoare triple {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} call main_#t~ret34#1 := rand_end_point(); {38094#true} is VALID [2022-02-20 23:45:26,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {38094#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {38094#true} is VALID [2022-02-20 23:45:26,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {38094#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {38094#true} is VALID [2022-02-20 23:45:26,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {38094#true} assume true; {38094#true} is VALID [2022-02-20 23:45:26,775 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38094#true} {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #312#return; {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:26,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {38096#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {38101#(and (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:45:26,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {38101#(and (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (= (+ (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: L659 {38102#(and (= (+ (* (- 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_is_empty_~list#1.base|) 8) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:45:26,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {38102#(and (= (+ (* (- 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_is_empty_~list#1.base|) 8) (= (+ (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; {38102#(and (= (+ (* (- 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_is_empty_~list#1.base|) 8) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:45:26,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {38102#(and (= (+ (* (- 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_is_empty_~list#1.base|) 8) (= (+ (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: L660 {38103#(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:45:26,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {38103#(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; {38103#(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:45:26,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {38103#(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); {38103#(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:45:26,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {38103#(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; {38103#(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:45:26,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {38103#(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~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {38103#(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:45:26,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {38103#(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~ret20#1);havoc remove_one_#t~ret20#1; {38103#(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:45:26,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {38103#(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); {38095#false} is VALID [2022-02-20 23:45:26,781 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:45:26,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:26,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740925256] [2022-02-20 23:45:26,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740925256] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:26,782 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:26,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:26,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199456489] [2022-02-20 23:45:26,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:26,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:26,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:26,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:26,800 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:45:26,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:26,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:26,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:26,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:26,801 INFO L87 Difference]: Start difference. First operand 439 states and 623 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,683 INFO L93 Difference]: Finished difference Result 491 states and 648 transitions. [2022-02-20 23:45:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:27,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 307 transitions. [2022-02-20 23:45:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 307 transitions. [2022-02-20 23:45:27,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 307 transitions. [2022-02-20 23:45:27,942 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:45:27,953 INFO L225 Difference]: With dead ends: 491 [2022-02-20 23:45:27,953 INFO L226 Difference]: Without dead ends: 491 [2022-02-20 23:45:27,954 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:45:27,955 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 366 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:27,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 543 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-02-20 23:45:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 439. [2022-02-20 23:45:27,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:27,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand has 439 states, 356 states have (on average 1.6404494382022472) internal successors, (584), 420 states have internal predecessors, (584), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:27,967 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand has 439 states, 356 states have (on average 1.6404494382022472) internal successors, (584), 420 states have internal predecessors, (584), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:27,968 INFO L87 Difference]: Start difference. First operand 491 states. Second operand has 439 states, 356 states have (on average 1.6404494382022472) internal successors, (584), 420 states have internal predecessors, (584), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,981 INFO L93 Difference]: Finished difference Result 491 states and 648 transitions. [2022-02-20 23:45:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 648 transitions. [2022-02-20 23:45:27,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:27,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:27,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 439 states, 356 states have (on average 1.6404494382022472) internal successors, (584), 420 states have internal predecessors, (584), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 491 states. [2022-02-20 23:45:27,983 INFO L87 Difference]: Start difference. First operand has 439 states, 356 states have (on average 1.6404494382022472) internal successors, (584), 420 states have internal predecessors, (584), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 491 states. [2022-02-20 23:45:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,996 INFO L93 Difference]: Finished difference Result 491 states and 648 transitions. [2022-02-20 23:45:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 648 transitions. [2022-02-20 23:45:27,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:27,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:27,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:27,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:27,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 356 states have (on average 1.6404494382022472) internal successors, (584), 420 states have internal predecessors, (584), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 614 transitions. [2022-02-20 23:45:28,010 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 614 transitions. Word has length 23 [2022-02-20 23:45:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:28,010 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 614 transitions. [2022-02-20 23:45:28,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 614 transitions. [2022-02-20 23:45:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:45:28,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:28,011 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:45:28,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:45:28,011 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1911985061, now seen corresponding path program 1 times [2022-02-20 23:45:28,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:28,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173891776] [2022-02-20 23:45:28,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:28,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:28,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:28,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {40024#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {40024#true} is VALID [2022-02-20 23:45:28,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {40024#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {40024#true} is VALID [2022-02-20 23:45:28,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {40024#true} assume true; {40024#true} is VALID [2022-02-20 23:45:28,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40024#true} {40024#true} #310#return; {40024#true} is VALID [2022-02-20 23:45:28,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {40024#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(12, 2);~#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); {40024#true} is VALID [2022-02-20 23:45:28,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {40024#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {40024#true} is VALID [2022-02-20 23:45:28,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {40024#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {40024#true} is VALID [2022-02-20 23:45:28,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {40024#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {40024#true} is VALID [2022-02-20 23:45:28,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {40024#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {40024#true} is VALID [2022-02-20 23:45:28,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {40024#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {40024#true} is VALID [2022-02-20 23:45:28,048 INFO L272 TraceCheckUtils]: 6: Hoare triple {40024#true} call main_#t~ret32#1 := rand_end_point(); {40024#true} is VALID [2022-02-20 23:45:28,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {40024#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {40024#true} is VALID [2022-02-20 23:45:28,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {40024#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {40024#true} is VALID [2022-02-20 23:45:28,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {40024#true} assume true; {40024#true} is VALID [2022-02-20 23:45:28,049 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40024#true} {40024#true} #310#return; {40024#true} is VALID [2022-02-20 23:45:28,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {40024#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {40024#true} is VALID [2022-02-20 23:45:28,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {40024#true} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {40024#true} is VALID [2022-02-20 23:45:28,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {40024#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; {40024#true} is VALID [2022-02-20 23:45:28,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {40024#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; {40024#true} is VALID [2022-02-20 23:45:28,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {40024#true} havoc create_item_#t~switch6#1; {40024#true} is VALID [2022-02-20 23:45:28,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {40024#true} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {40024#true} is VALID [2022-02-20 23:45:28,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {40024#true} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {40024#true} is VALID [2022-02-20 23:45:28,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {40024#true} assume !create_item_#t~short10#1; {40030#(not |ULTIMATE.start_create_item_#t~short10#1|)} is VALID [2022-02-20 23:45:28,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {40030#(not |ULTIMATE.start_create_item_#t~short10#1|)} create_item_#t~short12#1 := create_item_#t~short10#1; {40031#(not |ULTIMATE.start_create_item_#t~short12#1|)} is VALID [2022-02-20 23:45:28,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {40031#(not |ULTIMATE.start_create_item_#t~short12#1|)} assume create_item_#t~short12#1;assume -2147483648 <= create_item_#t~nondet11#1 && create_item_#t~nondet11#1 <= 2147483647;create_item_#t~short12#1 := 0 != create_item_#t~nondet11#1; {40025#false} is VALID [2022-02-20 23:45:28,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {40025#false} assume !create_item_#t~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {40025#false} is VALID [2022-02-20 23:45:28,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {40025#false} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-13 {40025#false} is VALID [2022-02-20 23:45:28,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {40025#false} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {40025#false} is VALID [2022-02-20 23:45:28,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {40025#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); {40025#false} is VALID [2022-02-20 23:45:28,052 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:45:28,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:28,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173891776] [2022-02-20 23:45:28,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173891776] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:28,053 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:28,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:28,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882811460] [2022-02-20 23:45:28,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:28,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) 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:45:28,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:28,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) 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:45:28,070 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:45:28,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:28,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:28,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:28,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:28,072 INFO L87 Difference]: Start difference. First operand 439 states and 614 transitions. Second operand has 4 states, 4 states have (on average 5.75) 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:45:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:28,287 INFO L93 Difference]: Finished difference Result 451 states and 626 transitions. [2022-02-20 23:45:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:28,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) 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:45:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) 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:45:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2022-02-20 23:45:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) 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:45:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2022-02-20 23:45:28,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 193 transitions. [2022-02-20 23:45:28,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:28,426 INFO L225 Difference]: With dead ends: 451 [2022-02-20 23:45:28,426 INFO L226 Difference]: Without dead ends: 451 [2022-02-20 23:45:28,426 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:45:28,427 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 3 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:28,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 541 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-02-20 23:45:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 448. [2022-02-20 23:45:28,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:28,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 448 states, 365 states have (on average 1.6246575342465754) internal successors, (593), 429 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:28,434 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 448 states, 365 states have (on average 1.6246575342465754) internal successors, (593), 429 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:28,434 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 448 states, 365 states have (on average 1.6246575342465754) internal successors, (593), 429 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:28,445 INFO L93 Difference]: Finished difference Result 451 states and 626 transitions. [2022-02-20 23:45:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 626 transitions. [2022-02-20 23:45:28,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:28,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:28,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 448 states, 365 states have (on average 1.6246575342465754) internal successors, (593), 429 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 451 states. [2022-02-20 23:45:28,448 INFO L87 Difference]: Start difference. First operand has 448 states, 365 states have (on average 1.6246575342465754) internal successors, (593), 429 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 451 states. [2022-02-20 23:45:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:28,458 INFO L93 Difference]: Finished difference Result 451 states and 626 transitions. [2022-02-20 23:45:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 626 transitions. [2022-02-20 23:45:28,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:28,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:28,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:28,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 365 states have (on average 1.6246575342465754) internal successors, (593), 429 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 623 transitions. [2022-02-20 23:45:28,468 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 623 transitions. Word has length 25 [2022-02-20 23:45:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:28,468 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 623 transitions. [2022-02-20 23:45:28,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) 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:45:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 623 transitions. [2022-02-20 23:45:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:45:28,468 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:28,468 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:45:28,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:45:28,468 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1913832103, now seen corresponding path program 1 times [2022-02-20 23:45:28,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:28,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181885675] [2022-02-20 23:45:28,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:28,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:28,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:28,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {41837#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {41837#true} is VALID [2022-02-20 23:45:28,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {41837#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {41837#true} is VALID [2022-02-20 23:45:28,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {41837#true} assume true; {41837#true} is VALID [2022-02-20 23:45:28,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41837#true} {41837#true} #310#return; {41837#true} is VALID [2022-02-20 23:45:28,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {41837#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(12, 2);~#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); {41837#true} is VALID [2022-02-20 23:45:28,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {41837#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {41837#true} is VALID [2022-02-20 23:45:28,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {41837#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {41837#true} is VALID [2022-02-20 23:45:28,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {41837#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {41837#true} is VALID [2022-02-20 23:45:28,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {41837#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {41837#true} is VALID [2022-02-20 23:45:28,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {41837#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {41837#true} is VALID [2022-02-20 23:45:28,525 INFO L272 TraceCheckUtils]: 6: Hoare triple {41837#true} call main_#t~ret32#1 := rand_end_point(); {41837#true} is VALID [2022-02-20 23:45:28,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {41837#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {41837#true} is VALID [2022-02-20 23:45:28,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {41837#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {41837#true} is VALID [2022-02-20 23:45:28,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {41837#true} assume true; {41837#true} is VALID [2022-02-20 23:45:28,526 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41837#true} {41837#true} #310#return; {41837#true} is VALID [2022-02-20 23:45:28,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {41837#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {41843#(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:45:28,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {41843#(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); {41843#(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:45:28,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {41843#(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; {41843#(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:45:28,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {41843#(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; {41844#(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:45:28,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {41844#(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; {41844#(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:45:28,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {41844#(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))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {41844#(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:45:28,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {41844#(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))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {41844#(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:45:28,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {41844#(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 !create_item_#t~short10#1; {41844#(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:45:28,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {41844#(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))} create_item_#t~short12#1 := create_item_#t~short10#1; {41844#(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:45:28,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {41844#(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 !create_item_#t~short12#1; {41844#(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:45:28,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {41844#(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 !create_item_#t~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {41844#(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:45:28,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {41844#(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))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-13 {41844#(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:45:28,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {41844#(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))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {41844#(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:45:28,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {41844#(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); {41838#false} is VALID [2022-02-20 23:45:28,534 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:45:28,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:28,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181885675] [2022-02-20 23:45:28,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181885675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:28,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:28,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:28,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002730360] [2022-02-20 23:45:28,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:28,535 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:45:28,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:28,536 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:45:28,553 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:45:28,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:28,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:28,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:28,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:28,555 INFO L87 Difference]: Start difference. First operand 448 states and 623 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:45:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:29,116 INFO L93 Difference]: Finished difference Result 756 states and 1001 transitions. [2022-02-20 23:45:29,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:29,116 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:45:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:29,117 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:45:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2022-02-20 23:45:29,118 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:45:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2022-02-20 23:45:29,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 460 transitions. [2022-02-20 23:45:29,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:29,448 INFO L225 Difference]: With dead ends: 756 [2022-02-20 23:45:29,448 INFO L226 Difference]: Without dead ends: 756 [2022-02-20 23:45:29,448 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:45:29,449 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 494 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:29,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 408 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-02-20 23:45:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 507. [2022-02-20 23:45:29,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:29,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 756 states. Second operand has 507 states, 425 states have (on average 1.6) internal successors, (680), 488 states have internal predecessors, (680), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:29,459 INFO L74 IsIncluded]: Start isIncluded. First operand 756 states. Second operand has 507 states, 425 states have (on average 1.6) internal successors, (680), 488 states have internal predecessors, (680), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:29,460 INFO L87 Difference]: Start difference. First operand 756 states. Second operand has 507 states, 425 states have (on average 1.6) internal successors, (680), 488 states have internal predecessors, (680), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:29,484 INFO L93 Difference]: Finished difference Result 756 states and 1001 transitions. [2022-02-20 23:45:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1001 transitions. [2022-02-20 23:45:29,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:29,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:29,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 507 states, 425 states have (on average 1.6) internal successors, (680), 488 states have internal predecessors, (680), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 756 states. [2022-02-20 23:45:29,487 INFO L87 Difference]: Start difference. First operand has 507 states, 425 states have (on average 1.6) internal successors, (680), 488 states have internal predecessors, (680), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 756 states. [2022-02-20 23:45:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:29,512 INFO L93 Difference]: Finished difference Result 756 states and 1001 transitions. [2022-02-20 23:45:29,512 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1001 transitions. [2022-02-20 23:45:29,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:29,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:29,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:29,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 425 states have (on average 1.6) internal successors, (680), 488 states have internal predecessors, (680), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 710 transitions. [2022-02-20 23:45:29,526 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 710 transitions. Word has length 25 [2022-02-20 23:45:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:29,526 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 710 transitions. [2022-02-20 23:45:29,526 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:45:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 710 transitions. [2022-02-20 23:45:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:45:29,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:29,527 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:45:29,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 23:45:29,527 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:29,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:29,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1913832102, now seen corresponding path program 1 times [2022-02-20 23:45:29,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:29,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91106299] [2022-02-20 23:45:29,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:29,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:29,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {44622#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {44622#true} is VALID [2022-02-20 23:45:29,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {44622#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {44622#true} is VALID [2022-02-20 23:45:29,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {44622#true} assume true; {44622#true} is VALID [2022-02-20 23:45:29,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44622#true} {44622#true} #310#return; {44622#true} is VALID [2022-02-20 23:45:29,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {44622#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(12, 2);~#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); {44622#true} is VALID [2022-02-20 23:45:29,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {44622#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {44622#true} is VALID [2022-02-20 23:45:29,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {44622#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {44622#true} is VALID [2022-02-20 23:45:29,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {44622#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {44622#true} is VALID [2022-02-20 23:45:29,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {44622#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {44622#true} is VALID [2022-02-20 23:45:29,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {44622#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {44622#true} is VALID [2022-02-20 23:45:29,557 INFO L272 TraceCheckUtils]: 6: Hoare triple {44622#true} call main_#t~ret32#1 := rand_end_point(); {44622#true} is VALID [2022-02-20 23:45:29,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {44622#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {44622#true} is VALID [2022-02-20 23:45:29,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {44622#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {44622#true} is VALID [2022-02-20 23:45:29,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {44622#true} assume true; {44622#true} is VALID [2022-02-20 23:45:29,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44622#true} {44622#true} #310#return; {44622#true} is VALID [2022-02-20 23:45:29,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {44622#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {44628#(= 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); {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {44628#(= 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; {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {44628#(= 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; {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} havoc create_item_#t~switch6#1; {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !create_item_#t~short10#1; {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} create_item_#t~short12#1 := create_item_#t~short10#1; {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !create_item_#t~short12#1; {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !create_item_#t~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-13 {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:29,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {44628#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !(1 == #valid[create_item_~item~0#1.base]); {44623#false} is VALID [2022-02-20 23:45:29,565 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:45:29,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:29,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91106299] [2022-02-20 23:45:29,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91106299] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:29,565 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:29,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:29,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722456375] [2022-02-20 23:45:29,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:29,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:29,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:29,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:29,582 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:45:29,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:29,583 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:29,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:29,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:29,583 INFO L87 Difference]: Start difference. First operand 507 states and 710 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:29,885 INFO L93 Difference]: Finished difference Result 594 states and 801 transitions. [2022-02-20 23:45:29,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:29,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:29,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2022-02-20 23:45:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2022-02-20 23:45:29,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 285 transitions. [2022-02-20 23:45:30,100 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:45:30,117 INFO L225 Difference]: With dead ends: 594 [2022-02-20 23:45:30,117 INFO L226 Difference]: Without dead ends: 594 [2022-02-20 23:45:30,117 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:45:30,118 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 148 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:30,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 272 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-02-20 23:45:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 504. [2022-02-20 23:45:30,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:30,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 594 states. Second operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:30,127 INFO L74 IsIncluded]: Start isIncluded. First operand 594 states. Second operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:30,127 INFO L87 Difference]: Start difference. First operand 594 states. Second operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:30,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:30,145 INFO L93 Difference]: Finished difference Result 594 states and 801 transitions. [2022-02-20 23:45:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 801 transitions. [2022-02-20 23:45:30,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:30,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:30,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 594 states. [2022-02-20 23:45:30,148 INFO L87 Difference]: Start difference. First operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 594 states. [2022-02-20 23:45:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:30,166 INFO L93 Difference]: Finished difference Result 594 states and 801 transitions. [2022-02-20 23:45:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 801 transitions. [2022-02-20 23:45:30,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:30,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:30,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:30,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 698 transitions. [2022-02-20 23:45:30,182 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 698 transitions. Word has length 25 [2022-02-20 23:45:30,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:30,182 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 698 transitions. [2022-02-20 23:45:30,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 698 transitions. [2022-02-20 23:45:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:45:30,184 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:30,184 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] [2022-02-20 23:45:30,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:45:30,184 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:30,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2102112361, now seen corresponding path program 1 times [2022-02-20 23:45:30,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:30,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567261891] [2022-02-20 23:45:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:30,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:30,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:30,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {46917#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {46917#true} is VALID [2022-02-20 23:45:30,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {46917#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {46917#true} is VALID [2022-02-20 23:45:30,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {46917#true} assume true; {46917#true} is VALID [2022-02-20 23:45:30,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46917#true} {46917#true} #310#return; {46917#true} is VALID [2022-02-20 23:45:30,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {46917#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(12, 2);~#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); {46917#true} is VALID [2022-02-20 23:45:30,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {46917#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {46917#true} is VALID [2022-02-20 23:45:30,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {46917#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {46917#true} is VALID [2022-02-20 23:45:30,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {46917#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {46917#true} is VALID [2022-02-20 23:45:30,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {46917#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {46917#true} is VALID [2022-02-20 23:45:30,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {46917#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {46917#true} is VALID [2022-02-20 23:45:30,262 INFO L272 TraceCheckUtils]: 6: Hoare triple {46917#true} call main_#t~ret32#1 := rand_end_point(); {46917#true} is VALID [2022-02-20 23:45:30,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {46917#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {46917#true} is VALID [2022-02-20 23:45:30,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {46917#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {46917#true} is VALID [2022-02-20 23:45:30,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {46917#true} assume true; {46917#true} is VALID [2022-02-20 23:45:30,262 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {46917#true} {46917#true} #310#return; {46917#true} is VALID [2022-02-20 23:45:30,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {46917#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {46923#(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:45:30,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {46923#(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); {46923#(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:45:30,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {46923#(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; {46923#(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:45:30,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {46923#(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_#t~switch6#1 := create_item_#t~switch6#1 || create_item_~at#1 == ~unnamed1~0~LIST_END; {46923#(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:45:30,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {46923#(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_PREV;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_NEXT; {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:30,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} havoc create_item_#t~switch6#1; {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:30,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:30,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:30,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} assume !create_item_#t~short10#1; {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:30,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} create_item_#t~short12#1 := create_item_#t~short10#1; {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:30,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} assume !create_item_#t~short12#1; {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:30,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} assume !create_item_#t~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:30,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-13 {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:30,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:30,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {46924#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV))} 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); {46918#false} is VALID [2022-02-20 23:45:30,271 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:45:30,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:30,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567261891] [2022-02-20 23:45:30,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567261891] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:30,272 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:30,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:30,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20349097] [2022-02-20 23:45:30,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:30,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 26 [2022-02-20 23:45:30,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:30,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:45:30,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:30,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:30,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:30,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:30,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:30,297 INFO L87 Difference]: Start difference. First operand 504 states and 698 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:45:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:30,907 INFO L93 Difference]: Finished difference Result 810 states and 1070 transitions. [2022-02-20 23:45:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:30,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 26 [2022-02-20 23:45:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:45:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2022-02-20 23:45:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:45:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2022-02-20 23:45:30,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 452 transitions. [2022-02-20 23:45:31,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:31,248 INFO L225 Difference]: With dead ends: 810 [2022-02-20 23:45:31,248 INFO L226 Difference]: Without dead ends: 810 [2022-02-20 23:45:31,249 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:45:31,249 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 323 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:31,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 584 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-02-20 23:45:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 504. [2022-02-20 23:45:31,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:31,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 810 states. Second operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:31,259 INFO L74 IsIncluded]: Start isIncluded. First operand 810 states. Second operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:31,259 INFO L87 Difference]: Start difference. First operand 810 states. Second operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:31,288 INFO L93 Difference]: Finished difference Result 810 states and 1070 transitions. [2022-02-20 23:45:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1070 transitions. [2022-02-20 23:45:31,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:31,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:31,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 810 states. [2022-02-20 23:45:31,291 INFO L87 Difference]: Start difference. First operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 810 states. [2022-02-20 23:45:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:31,322 INFO L93 Difference]: Finished difference Result 810 states and 1070 transitions. [2022-02-20 23:45:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1070 transitions. [2022-02-20 23:45:31,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:31,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:31,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:31,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 698 transitions. [2022-02-20 23:45:31,337 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 698 transitions. Word has length 26 [2022-02-20 23:45:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:31,337 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 698 transitions. [2022-02-20 23:45:31,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:45:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 698 transitions. [2022-02-20 23:45:31,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:45:31,338 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:31,338 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] [2022-02-20 23:45:31,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-20 23:45:31,338 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1491790357, now seen corresponding path program 1 times [2022-02-20 23:45:31,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:31,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787678774] [2022-02-20 23:45:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:31,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:31,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {49861#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {49861#true} is VALID [2022-02-20 23:45:31,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {49861#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {49870#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:31,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {49870#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {49870#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:31,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49870#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {49861#true} #310#return; {49867#(and (<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret32#1|) (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:31,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {49861#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(12, 2);~#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); {49861#true} is VALID [2022-02-20 23:45:31,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {49861#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {49861#true} is VALID [2022-02-20 23:45:31,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {49861#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {49861#true} is VALID [2022-02-20 23:45:31,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {49861#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {49861#true} is VALID [2022-02-20 23:45:31,407 INFO L290 TraceCheckUtils]: 4: Hoare triple {49861#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {49861#true} is VALID [2022-02-20 23:45:31,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {49861#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {49861#true} is VALID [2022-02-20 23:45:31,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {49861#true} call main_#t~ret32#1 := rand_end_point(); {49861#true} is VALID [2022-02-20 23:45:31,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {49861#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {49861#true} is VALID [2022-02-20 23:45:31,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {49861#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {49870#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:31,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {49870#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {49870#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:31,408 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49870#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {49861#true} #310#return; {49867#(and (<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret32#1|) (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:31,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {49867#(and (<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret32#1|) (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_END))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {49868#(= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:45:31,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {49868#(= ~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); {49868#(= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:45:31,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {49868#(= ~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; {49868#(= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:45:31,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {49868#(= ~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; {49869#|ULTIMATE.start_create_item_#t~switch6#1|} is VALID [2022-02-20 23:45:31,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {49869#|ULTIMATE.start_create_item_#t~switch6#1|} assume !create_item_#t~switch6#1; {49862#false} is VALID [2022-02-20 23:45:31,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {49862#false} havoc create_item_#t~switch6#1; {49862#false} is VALID [2022-02-20 23:45:31,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {49862#false} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {49862#false} is VALID [2022-02-20 23:45:31,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {49862#false} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {49862#false} is VALID [2022-02-20 23:45:31,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {49862#false} assume !create_item_#t~short10#1; {49862#false} is VALID [2022-02-20 23:45:31,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {49862#false} create_item_#t~short12#1 := create_item_#t~short10#1; {49862#false} is VALID [2022-02-20 23:45:31,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {49862#false} assume !create_item_#t~short12#1; {49862#false} is VALID [2022-02-20 23:45:31,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {49862#false} assume !create_item_#t~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {49862#false} is VALID [2022-02-20 23:45:31,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {49862#false} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-13 {49862#false} is VALID [2022-02-20 23:45:31,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {49862#false} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {49862#false} is VALID [2022-02-20 23:45:31,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {49862#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); {49862#false} is VALID [2022-02-20 23:45:31,412 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:45:31,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:31,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787678774] [2022-02-20 23:45:31,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787678774] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:31,413 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:31,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:31,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638848661] [2022-02-20 23:45:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:31,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2022-02-20 23:45:31,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:31,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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:45:31,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:31,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:31,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:31,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:31,431 INFO L87 Difference]: Start difference. First operand 504 states and 698 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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:45:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:32,092 INFO L93 Difference]: Finished difference Result 708 states and 959 transitions. [2022-02-20 23:45:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:32,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2022-02-20 23:45:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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:45:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 359 transitions. [2022-02-20 23:45:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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:45:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 359 transitions. [2022-02-20 23:45:32,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 359 transitions. [2022-02-20 23:45:32,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:32,331 INFO L225 Difference]: With dead ends: 708 [2022-02-20 23:45:32,331 INFO L226 Difference]: Without dead ends: 708 [2022-02-20 23:45:32,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:32,332 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 233 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:32,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 1491 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:32,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-02-20 23:45:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 443. [2022-02-20 23:45:32,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:32,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 708 states. Second operand has 443 states, 365 states have (on average 1.5726027397260274) internal successors, (574), 424 states have internal predecessors, (574), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:32,341 INFO L74 IsIncluded]: Start isIncluded. First operand 708 states. Second operand has 443 states, 365 states have (on average 1.5726027397260274) internal successors, (574), 424 states have internal predecessors, (574), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:32,341 INFO L87 Difference]: Start difference. First operand 708 states. Second operand has 443 states, 365 states have (on average 1.5726027397260274) internal successors, (574), 424 states have internal predecessors, (574), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:32,363 INFO L93 Difference]: Finished difference Result 708 states and 959 transitions. [2022-02-20 23:45:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 959 transitions. [2022-02-20 23:45:32,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:32,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:32,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 443 states, 365 states have (on average 1.5726027397260274) internal successors, (574), 424 states have internal predecessors, (574), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 708 states. [2022-02-20 23:45:32,365 INFO L87 Difference]: Start difference. First operand has 443 states, 365 states have (on average 1.5726027397260274) internal successors, (574), 424 states have internal predecessors, (574), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 708 states. [2022-02-20 23:45:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:32,386 INFO L93 Difference]: Finished difference Result 708 states and 959 transitions. [2022-02-20 23:45:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 959 transitions. [2022-02-20 23:45:32,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:32,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:32,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:32,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 365 states have (on average 1.5726027397260274) internal successors, (574), 424 states have internal predecessors, (574), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 604 transitions. [2022-02-20 23:45:32,396 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 604 transitions. Word has length 26 [2022-02-20 23:45:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:32,396 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 604 transitions. [2022-02-20 23:45:32,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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:45:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 604 transitions. [2022-02-20 23:45:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:45:32,396 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:32,396 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:45:32,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-20 23:45:32,397 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:32,397 INFO L85 PathProgramCache]: Analyzing trace with hash 731575509, now seen corresponding path program 1 times [2022-02-20 23:45:32,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:32,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14342243] [2022-02-20 23:45:32,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:32,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:32,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {52444#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {52444#true} is VALID [2022-02-20 23:45:32,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {52444#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {52444#true} is VALID [2022-02-20 23:45:32,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {52444#true} assume true; {52444#true} is VALID [2022-02-20 23:45:32,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52444#true} {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #312#return; {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:32,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {52444#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(12, 2);~#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); {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:32,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {52446#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:32,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:32,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:32,475 INFO L290 TraceCheckUtils]: 4: Hoare triple {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:32,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:32,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:32,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:32,477 INFO L272 TraceCheckUtils]: 8: Hoare triple {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} call main_#t~ret34#1 := rand_end_point(); {52444#true} is VALID [2022-02-20 23:45:32,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {52444#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {52444#true} is VALID [2022-02-20 23:45:32,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {52444#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {52444#true} is VALID [2022-02-20 23:45:32,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {52444#true} assume true; {52444#true} is VALID [2022-02-20 23:45:32,478 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {52444#true} {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #312#return; {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:32,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {52446#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {52451#(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:45:32,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {52451#(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: L659 {52451#(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:45:32,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {52451#(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; {52451#(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:45:32,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {52451#(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: L660 {52451#(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:45:32,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {52451#(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; {52451#(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:45:32,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {52451#(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); {52451#(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:45:32,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {52451#(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; {52451#(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:45:32,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {52451#(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~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {52451#(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:45:32,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {52451#(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~ret20#1);havoc remove_one_#t~ret20#1; {52451#(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:45:32,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {52451#(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~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {52451#(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:45:32,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {52451#(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~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {52451#(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:45:32,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {52451#(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~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {52451#(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:45:32,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {52451#(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~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L707 {52452#(= |ULTIMATE.start_remove_one_#t~mem23#1.offset| 0)} is VALID [2022-02-20 23:45:32,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {52452#(= |ULTIMATE.start_remove_one_#t~mem23#1.offset| 0)} assume !(0 == remove_one_#t~mem23#1.offset); {52445#false} is VALID [2022-02-20 23:45:32,485 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:45:32,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:32,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14342243] [2022-02-20 23:45:32,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14342243] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:32,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:32,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:32,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833399596] [2022-02-20 23:45:32,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:32,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:45:32,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:32,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:45:32,507 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:45:32,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:32,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:32,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:32,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:32,508 INFO L87 Difference]: Start difference. First operand 443 states and 604 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:45:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:33,080 INFO L93 Difference]: Finished difference Result 517 states and 672 transitions. [2022-02-20 23:45:33,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:33,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:45:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:45:33,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 308 transitions. [2022-02-20 23:45:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:45:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 308 transitions. [2022-02-20 23:45:33,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 308 transitions. [2022-02-20 23:45:33,309 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:45:33,317 INFO L225 Difference]: With dead ends: 517 [2022-02-20 23:45:33,317 INFO L226 Difference]: Without dead ends: 517 [2022-02-20 23:45:33,317 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:45:33,318 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 167 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:33,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 660 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-02-20 23:45:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 443. [2022-02-20 23:45:33,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:33,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 517 states. Second operand has 443 states, 365 states have (on average 1.5698630136986302) internal successors, (573), 424 states have internal predecessors, (573), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:33,325 INFO L74 IsIncluded]: Start isIncluded. First operand 517 states. Second operand has 443 states, 365 states have (on average 1.5698630136986302) internal successors, (573), 424 states have internal predecessors, (573), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:33,325 INFO L87 Difference]: Start difference. First operand 517 states. Second operand has 443 states, 365 states have (on average 1.5698630136986302) internal successors, (573), 424 states have internal predecessors, (573), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:33,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:33,338 INFO L93 Difference]: Finished difference Result 517 states and 672 transitions. [2022-02-20 23:45:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 672 transitions. [2022-02-20 23:45:33,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:33,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:33,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 443 states, 365 states have (on average 1.5698630136986302) internal successors, (573), 424 states have internal predecessors, (573), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 517 states. [2022-02-20 23:45:33,340 INFO L87 Difference]: Start difference. First operand has 443 states, 365 states have (on average 1.5698630136986302) internal successors, (573), 424 states have internal predecessors, (573), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 517 states. [2022-02-20 23:45:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:33,353 INFO L93 Difference]: Finished difference Result 517 states and 672 transitions. [2022-02-20 23:45:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 672 transitions. [2022-02-20 23:45:33,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:33,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:33,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:33,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 365 states have (on average 1.5698630136986302) internal successors, (573), 424 states have internal predecessors, (573), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 603 transitions. [2022-02-20 23:45:33,361 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 603 transitions. Word has length 27 [2022-02-20 23:45:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:33,361 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 603 transitions. [2022-02-20 23:45:33,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:45:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 603 transitions. [2022-02-20 23:45:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:45:33,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:33,362 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:45:33,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-20 23:45:33,362 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:33,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:33,362 INFO L85 PathProgramCache]: Analyzing trace with hash 946649543, now seen corresponding path program 1 times [2022-02-20 23:45:33,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:33,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220381103] [2022-02-20 23:45:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:33,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:33,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:33,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {54453#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {54453#true} is VALID [2022-02-20 23:45:33,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {54453#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {54453#true} is VALID [2022-02-20 23:45:33,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {54453#true} assume true; {54453#true} is VALID [2022-02-20 23:45:33,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54453#true} {54453#true} #310#return; {54453#true} is VALID [2022-02-20 23:45:33,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {54453#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(12, 2);~#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); {54453#true} is VALID [2022-02-20 23:45:33,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {54453#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {54453#true} is VALID [2022-02-20 23:45:33,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {54453#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {54453#true} is VALID [2022-02-20 23:45:33,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {54453#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {54453#true} is VALID [2022-02-20 23:45:33,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {54453#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {54453#true} is VALID [2022-02-20 23:45:33,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {54453#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {54453#true} is VALID [2022-02-20 23:45:33,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {54453#true} call main_#t~ret32#1 := rand_end_point(); {54453#true} is VALID [2022-02-20 23:45:33,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {54453#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {54453#true} is VALID [2022-02-20 23:45:33,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {54453#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {54453#true} is VALID [2022-02-20 23:45:33,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {54453#true} assume true; {54453#true} is VALID [2022-02-20 23:45:33,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {54453#true} {54453#true} #310#return; {54453#true} is VALID [2022-02-20 23:45:33,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {54453#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {54453#true} is VALID [2022-02-20 23:45:33,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {54453#true} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {54453#true} is VALID [2022-02-20 23:45:33,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {54453#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; {54453#true} is VALID [2022-02-20 23:45:33,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {54453#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; {54453#true} is VALID [2022-02-20 23:45:33,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {54453#true} havoc create_item_#t~switch6#1; {54453#true} is VALID [2022-02-20 23:45:33,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {54453#true} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {54459#(and (= |ULTIMATE.start_create_item_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem8#1.offset|))} is VALID [2022-02-20 23:45:33,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {54459#(and (= |ULTIMATE.start_create_item_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem8#1.offset|))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {54460#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)) |ULTIMATE.start_create_item_#t~short10#1|)} is VALID [2022-02-20 23:45:33,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {54460#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)) |ULTIMATE.start_create_item_#t~short10#1|)} assume !create_item_#t~short10#1; {54461#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} is VALID [2022-02-20 23:45:33,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {54461#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} create_item_#t~short12#1 := create_item_#t~short10#1; {54461#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} is VALID [2022-02-20 23:45:33,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {54461#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} assume !create_item_#t~short12#1; {54461#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} is VALID [2022-02-20 23:45:33,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {54461#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} assume !create_item_#t~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {54461#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} is VALID [2022-02-20 23:45:33,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {54461#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-13 {54462#(and (= |ULTIMATE.start_create_item_#t~mem14#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem14#1.base| 0))} is VALID [2022-02-20 23:45:33,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {54462#(and (= |ULTIMATE.start_create_item_#t~mem14#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem14#1.base| 0))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {54463#(and (= |ULTIMATE.start_create_item_~link~0#1.base| 0) (= |ULTIMATE.start_create_item_~link~0#1.offset| 0))} is VALID [2022-02-20 23:45:33,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {54463#(and (= |ULTIMATE.start_create_item_~link~0#1.base| 0) (= |ULTIMATE.start_create_item_~link~0#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L684 {54463#(and (= |ULTIMATE.start_create_item_~link~0#1.base| 0) (= |ULTIMATE.start_create_item_~link~0#1.offset| 0))} is VALID [2022-02-20 23:45:33,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {54463#(and (= |ULTIMATE.start_create_item_~link~0#1.base| 0) (= |ULTIMATE.start_create_item_~link~0#1.offset| 0))} assume create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0; {54454#false} is VALID [2022-02-20 23:45:33,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {54454#false} assume !(1 == #valid[create_item_~link~0#1.base]); {54454#false} is VALID [2022-02-20 23:45:33,441 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:45:33,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:33,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220381103] [2022-02-20 23:45:33,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220381103] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:33,442 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:33,442 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:45:33,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889637236] [2022-02-20 23:45:33,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:33,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) 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:45:33,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:33,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) 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:45:33,460 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:45:33,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:33,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:33,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:33,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:33,462 INFO L87 Difference]: Start difference. First operand 443 states and 603 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) 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:45:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:34,343 INFO L93 Difference]: Finished difference Result 645 states and 864 transitions. [2022-02-20 23:45:34,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:45:34,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) 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:45:34,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) 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:45:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 326 transitions. [2022-02-20 23:45:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) 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:45:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 326 transitions. [2022-02-20 23:45:34,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 326 transitions. [2022-02-20 23:45:34,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:34,560 INFO L225 Difference]: With dead ends: 645 [2022-02-20 23:45:34,560 INFO L226 Difference]: Without dead ends: 645 [2022-02-20 23:45:34,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:45:34,561 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 158 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:34,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 1294 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-02-20 23:45:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 473. [2022-02-20 23:45:34,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:34,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 645 states. Second operand has 473 states, 395 states have (on average 1.539240506329114) internal successors, (608), 454 states have internal predecessors, (608), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:34,570 INFO L74 IsIncluded]: Start isIncluded. First operand 645 states. Second operand has 473 states, 395 states have (on average 1.539240506329114) internal successors, (608), 454 states have internal predecessors, (608), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:34,570 INFO L87 Difference]: Start difference. First operand 645 states. Second operand has 473 states, 395 states have (on average 1.539240506329114) internal successors, (608), 454 states have internal predecessors, (608), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:34,589 INFO L93 Difference]: Finished difference Result 645 states and 864 transitions. [2022-02-20 23:45:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 864 transitions. [2022-02-20 23:45:34,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:34,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:34,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 473 states, 395 states have (on average 1.539240506329114) internal successors, (608), 454 states have internal predecessors, (608), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 645 states. [2022-02-20 23:45:34,591 INFO L87 Difference]: Start difference. First operand has 473 states, 395 states have (on average 1.539240506329114) internal successors, (608), 454 states have internal predecessors, (608), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 645 states. [2022-02-20 23:45:34,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:34,610 INFO L93 Difference]: Finished difference Result 645 states and 864 transitions. [2022-02-20 23:45:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 864 transitions. [2022-02-20 23:45:34,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:34,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:34,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:34,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 395 states have (on average 1.539240506329114) internal successors, (608), 454 states have internal predecessors, (608), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 638 transitions. [2022-02-20 23:45:34,624 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 638 transitions. Word has length 27 [2022-02-20 23:45:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:34,625 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 638 transitions. [2022-02-20 23:45:34,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) 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:45:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 638 transitions. [2022-02-20 23:45:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:45:34,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:34,626 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:45:34,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-20 23:45:34,626 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:34,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash 946649737, now seen corresponding path program 1 times [2022-02-20 23:45:34,627 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:34,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78153925] [2022-02-20 23:45:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:34,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:34,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:34,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {56882#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {56882#true} is VALID [2022-02-20 23:45:34,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {56882#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {56882#true} is VALID [2022-02-20 23:45:34,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {56882#true} assume true; {56882#true} is VALID [2022-02-20 23:45:34,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56882#true} {56882#true} #310#return; {56882#true} is VALID [2022-02-20 23:45:34,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {56882#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(12, 2);~#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); {56882#true} is VALID [2022-02-20 23:45:34,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {56882#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {56882#true} is VALID [2022-02-20 23:45:34,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {56882#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {56882#true} is VALID [2022-02-20 23:45:34,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {56882#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {56882#true} is VALID [2022-02-20 23:45:34,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {56882#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {56882#true} is VALID [2022-02-20 23:45:34,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {56882#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {56882#true} is VALID [2022-02-20 23:45:34,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {56882#true} call main_#t~ret32#1 := rand_end_point(); {56882#true} is VALID [2022-02-20 23:45:34,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {56882#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {56882#true} is VALID [2022-02-20 23:45:34,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {56882#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {56882#true} is VALID [2022-02-20 23:45:34,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {56882#true} assume true; {56882#true} is VALID [2022-02-20 23:45:34,686 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56882#true} {56882#true} #310#return; {56882#true} is VALID [2022-02-20 23:45:34,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {56882#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {56888#(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:45:34,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {56888#(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); {56888#(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:45:34,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {56888#(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; {56888#(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:45:34,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {56888#(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; {56889#(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:45:34,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {56889#(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; {56889#(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:45:34,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {56889#(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 create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {56889#(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:45:34,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {56889#(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))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {56889#(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:45:34,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {56889#(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 !create_item_#t~short10#1; {56889#(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:45:34,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {56889#(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))} create_item_#t~short12#1 := create_item_#t~short10#1; {56889#(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:45:34,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {56889#(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 !create_item_#t~short12#1; {56889#(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:45:34,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {56889#(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 !create_item_#t~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {56889#(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:45:34,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {56889#(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 create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-13 {56889#(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:45:34,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {56889#(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))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {56889#(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:45:34,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {56889#(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~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L684 {56889#(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:45:34,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {56889#(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 !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {56889#(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:45:34,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {56889#(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); {56883#false} is VALID [2022-02-20 23:45:34,695 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:45:34,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:34,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78153925] [2022-02-20 23:45:34,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78153925] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:34,696 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:34,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:34,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337595341] [2022-02-20 23:45:34,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:34,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:45:34,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:34,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:45:34,716 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:45:34,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:34,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:34,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:34,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:34,718 INFO L87 Difference]: Start difference. First operand 473 states and 638 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:45:35,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:35,222 INFO L93 Difference]: Finished difference Result 808 states and 1039 transitions. [2022-02-20 23:45:35,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:35,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:45:35,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:45:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2022-02-20 23:45:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:45:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2022-02-20 23:45:35,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 449 transitions. [2022-02-20 23:45:35,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 449 edges. 449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:35,553 INFO L225 Difference]: With dead ends: 808 [2022-02-20 23:45:35,554 INFO L226 Difference]: Without dead ends: 808 [2022-02-20 23:45:35,554 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:45:35,554 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 482 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:35,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 405 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-02-20 23:45:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 563. [2022-02-20 23:45:35,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:35,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 808 states. Second operand has 563 states, 485 states have (on average 1.5175257731958762) internal successors, (736), 544 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:35,564 INFO L74 IsIncluded]: Start isIncluded. First operand 808 states. Second operand has 563 states, 485 states have (on average 1.5175257731958762) internal successors, (736), 544 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:35,565 INFO L87 Difference]: Start difference. First operand 808 states. Second operand has 563 states, 485 states have (on average 1.5175257731958762) internal successors, (736), 544 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:35,592 INFO L93 Difference]: Finished difference Result 808 states and 1039 transitions. [2022-02-20 23:45:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1039 transitions. [2022-02-20 23:45:35,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:35,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:35,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 563 states, 485 states have (on average 1.5175257731958762) internal successors, (736), 544 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 808 states. [2022-02-20 23:45:35,594 INFO L87 Difference]: Start difference. First operand has 563 states, 485 states have (on average 1.5175257731958762) internal successors, (736), 544 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 808 states. [2022-02-20 23:45:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:35,625 INFO L93 Difference]: Finished difference Result 808 states and 1039 transitions. [2022-02-20 23:45:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1039 transitions. [2022-02-20 23:45:35,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:35,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:35,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:35,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 485 states have (on average 1.5175257731958762) internal successors, (736), 544 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 766 transitions. [2022-02-20 23:45:35,642 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 766 transitions. Word has length 27 [2022-02-20 23:45:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:35,643 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 766 transitions. [2022-02-20 23:45:35,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:45:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 766 transitions. [2022-02-20 23:45:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:45:35,643 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:35,644 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:45:35,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-20 23:45:35,644 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:35,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:35,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1204004541, now seen corresponding path program 1 times [2022-02-20 23:45:35,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:35,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083249535] [2022-02-20 23:45:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:35,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:35,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {59879#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {59879#true} is VALID [2022-02-20 23:45:35,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {59879#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {59879#true} is VALID [2022-02-20 23:45:35,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {59879#true} assume true; {59879#true} is VALID [2022-02-20 23:45:35,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59879#true} {59881#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} #312#return; {59881#(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:45:35,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {59879#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(12, 2);~#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); {59881#(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:45:35,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {59881#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {59881#(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:45:35,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {59881#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {59881#(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:45:35,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {59881#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {59881#(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:45:35,742 INFO L290 TraceCheckUtils]: 4: Hoare triple {59881#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {59881#(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:45:35,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {59881#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {59881#(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:45:35,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {59881#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {59881#(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:45:35,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {59881#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {59881#(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:45:35,744 INFO L272 TraceCheckUtils]: 8: Hoare triple {59881#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} call main_#t~ret34#1 := rand_end_point(); {59879#true} is VALID [2022-02-20 23:45:35,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {59879#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {59879#true} is VALID [2022-02-20 23:45:35,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {59879#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {59879#true} is VALID [2022-02-20 23:45:35,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {59879#true} assume true; {59879#true} is VALID [2022-02-20 23:45:35,745 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {59879#true} {59881#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} #312#return; {59881#(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:45:35,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {59881#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {59886#(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:45:35,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {59886#(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: L659 {59886#(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:45:35,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {59886#(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; {59886#(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:45:35,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {59886#(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: L660 {59886#(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:45:35,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {59886#(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; {59886#(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:45:35,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {59886#(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); {59886#(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:45:35,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {59886#(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; {59886#(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:45:35,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {59886#(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~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {59886#(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:45:35,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {59886#(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~ret20#1);havoc remove_one_#t~ret20#1; {59886#(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:45:35,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {59886#(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~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {59886#(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:45:35,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {59886#(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~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {59886#(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:45:35,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {59886#(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~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {59886#(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:45:35,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {59886#(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~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L707 {59887#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_#t~mem23#1.base| 0))} is VALID [2022-02-20 23:45:35,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {59887#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_#t~mem23#1.base| 0))} assume 0 == remove_one_#t~mem23#1.offset; {59887#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_#t~mem23#1.base| 0))} is VALID [2022-02-20 23:45:35,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {59887#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_#t~mem23#1.base| 0))} assume !(remove_one_#t~mem23#1.base < #StackHeapBarrier); {59880#false} is VALID [2022-02-20 23:45:35,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:45:35,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:35,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083249535] [2022-02-20 23:45:35,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083249535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:35,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:35,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:35,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412838902] [2022-02-20 23:45:35,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:35,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:45:35,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:35,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:45:35,777 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:45:35,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:35,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:35,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:35,779 INFO L87 Difference]: Start difference. First operand 563 states and 766 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:45:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,439 INFO L93 Difference]: Finished difference Result 758 states and 993 transitions. [2022-02-20 23:45:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:45:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:45:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 337 transitions. [2022-02-20 23:45:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:45:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 337 transitions. [2022-02-20 23:45:36,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 337 transitions. [2022-02-20 23:45:36,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:36,685 INFO L225 Difference]: With dead ends: 758 [2022-02-20 23:45:36,685 INFO L226 Difference]: Without dead ends: 758 [2022-02-20 23:45:36,685 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:45:36,685 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 218 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:36,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 665 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-02-20 23:45:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 601. [2022-02-20 23:45:36,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:36,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 758 states. Second operand has 601 states, 519 states have (on average 1.5144508670520231) internal successors, (786), 580 states have internal predecessors, (786), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:36,694 INFO L74 IsIncluded]: Start isIncluded. First operand 758 states. Second operand has 601 states, 519 states have (on average 1.5144508670520231) internal successors, (786), 580 states have internal predecessors, (786), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:36,694 INFO L87 Difference]: Start difference. First operand 758 states. Second operand has 601 states, 519 states have (on average 1.5144508670520231) internal successors, (786), 580 states have internal predecessors, (786), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,714 INFO L93 Difference]: Finished difference Result 758 states and 993 transitions. [2022-02-20 23:45:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 993 transitions. [2022-02-20 23:45:36,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:36,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:36,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 519 states have (on average 1.5144508670520231) internal successors, (786), 580 states have internal predecessors, (786), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) Second operand 758 states. [2022-02-20 23:45:36,716 INFO L87 Difference]: Start difference. First operand has 601 states, 519 states have (on average 1.5144508670520231) internal successors, (786), 580 states have internal predecessors, (786), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) Second operand 758 states. [2022-02-20 23:45:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,735 INFO L93 Difference]: Finished difference Result 758 states and 993 transitions. [2022-02-20 23:45:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 993 transitions. [2022-02-20 23:45:36,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:36,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:36,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:36,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 519 states have (on average 1.5144508670520231) internal successors, (786), 580 states have internal predecessors, (786), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 822 transitions. [2022-02-20 23:45:36,747 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 822 transitions. Word has length 28 [2022-02-20 23:45:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:36,747 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 822 transitions. [2022-02-20 23:45:36,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:45:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 822 transitions. [2022-02-20 23:45:36,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:45:36,747 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:36,748 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:45:36,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-20 23:45:36,748 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:36,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1495351243, now seen corresponding path program 1 times [2022-02-20 23:45:36,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:36,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002995430] [2022-02-20 23:45:36,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:36,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:36,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:36,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {62769#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {62769#true} is VALID [2022-02-20 23:45:36,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {62769#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {62769#true} is VALID [2022-02-20 23:45:36,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {62769#true} assume true; {62769#true} is VALID [2022-02-20 23:45:36,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62769#true} {62769#true} #310#return; {62769#true} is VALID [2022-02-20 23:45:36,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {62769#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(12, 2);~#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); {62769#true} is VALID [2022-02-20 23:45:36,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {62769#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {62769#true} is VALID [2022-02-20 23:45:36,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {62769#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {62769#true} is VALID [2022-02-20 23:45:36,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {62769#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {62769#true} is VALID [2022-02-20 23:45:36,801 INFO L290 TraceCheckUtils]: 4: Hoare triple {62769#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {62769#true} is VALID [2022-02-20 23:45:36,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {62769#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {62769#true} is VALID [2022-02-20 23:45:36,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {62769#true} call main_#t~ret32#1 := rand_end_point(); {62769#true} is VALID [2022-02-20 23:45:36,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {62769#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {62769#true} is VALID [2022-02-20 23:45:36,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {62769#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {62769#true} is VALID [2022-02-20 23:45:36,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {62769#true} assume true; {62769#true} is VALID [2022-02-20 23:45:36,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {62769#true} {62769#true} #310#return; {62769#true} is VALID [2022-02-20 23:45:36,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {62769#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {62775#(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:45:36,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {62775#(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); {62775#(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:45:36,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {62775#(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; {62775#(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:45:36,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {62775#(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_#t~switch6#1 := create_item_#t~switch6#1 || create_item_~at#1 == ~unnamed1~0~LIST_END; {62775#(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:45:36,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {62775#(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_PREV;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_NEXT; {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:36,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} havoc create_item_#t~switch6#1; {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:36,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:36,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:36,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} assume !create_item_#t~short10#1; {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:36,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} create_item_#t~short12#1 := create_item_#t~short10#1; {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:36,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} assume !create_item_#t~short12#1; {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:36,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} assume !create_item_#t~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:36,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-13 {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:36,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:36,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L684 {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:36,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:36,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {62776#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_NEXT 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))))} 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); {62770#false} is VALID [2022-02-20 23:45:36,811 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:45:36,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:36,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002995430] [2022-02-20 23:45:36,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002995430] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:36,812 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:36,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:36,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612044576] [2022-02-20 23:45:36,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:36,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:45:36,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:36,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:45:36,833 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:45:36,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:36,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:36,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:36,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:36,834 INFO L87 Difference]: Start difference. First operand 601 states and 822 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:45:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:37,463 INFO L93 Difference]: Finished difference Result 845 states and 1089 transitions. [2022-02-20 23:45:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:37,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:45:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:45:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-02-20 23:45:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:45:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-02-20 23:45:37,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-02-20 23:45:37,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:37,793 INFO L225 Difference]: With dead ends: 845 [2022-02-20 23:45:37,793 INFO L226 Difference]: Without dead ends: 845 [2022-02-20 23:45:37,793 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:45:37,794 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 317 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:37,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 587 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:37,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-02-20 23:45:37,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 510. [2022-02-20 23:45:37,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:37,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 510 states, 429 states have (on average 1.5198135198135199) internal successors, (652), 489 states have internal predecessors, (652), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:37,803 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 510 states, 429 states have (on average 1.5198135198135199) internal successors, (652), 489 states have internal predecessors, (652), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:37,803 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 510 states, 429 states have (on average 1.5198135198135199) internal successors, (652), 489 states have internal predecessors, (652), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:37,833 INFO L93 Difference]: Finished difference Result 845 states and 1089 transitions. [2022-02-20 23:45:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1089 transitions. [2022-02-20 23:45:37,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:37,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:37,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 510 states, 429 states have (on average 1.5198135198135199) internal successors, (652), 489 states have internal predecessors, (652), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) Second operand 845 states. [2022-02-20 23:45:37,834 INFO L87 Difference]: Start difference. First operand has 510 states, 429 states have (on average 1.5198135198135199) internal successors, (652), 489 states have internal predecessors, (652), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) Second operand 845 states. [2022-02-20 23:45:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:37,868 INFO L93 Difference]: Finished difference Result 845 states and 1089 transitions. [2022-02-20 23:45:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1089 transitions. [2022-02-20 23:45:37,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:37,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:37,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:37,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 429 states have (on average 1.5198135198135199) internal successors, (652), 489 states have internal predecessors, (652), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 688 transitions. [2022-02-20 23:45:37,887 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 688 transitions. Word has length 28 [2022-02-20 23:45:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:37,888 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 688 transitions. [2022-02-20 23:45:37,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:45:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 688 transitions. [2022-02-20 23:45:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:37,888 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:37,889 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:45:37,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-20 23:45:37,889 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1910467130, now seen corresponding path program 1 times [2022-02-20 23:45:37,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:37,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255530403] [2022-02-20 23:45:37,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:37,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:37,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {65824#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {65824#true} is VALID [2022-02-20 23:45:37,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {65824#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {65834#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:37,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {65834#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {65834#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:37,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65834#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {65824#true} #312#return; {65830#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret34#1|) (<= |ULTIMATE.start_main_#t~ret34#1| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:37,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {65824#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(12, 2);~#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); {65824#true} is VALID [2022-02-20 23:45:37,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {65824#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {65824#true} is VALID [2022-02-20 23:45:37,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {65824#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {65824#true} is VALID [2022-02-20 23:45:37,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {65824#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {65824#true} is VALID [2022-02-20 23:45:37,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {65824#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {65824#true} is VALID [2022-02-20 23:45:37,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {65824#true} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {65824#true} is VALID [2022-02-20 23:45:37,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {65824#true} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {65824#true} is VALID [2022-02-20 23:45:37,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {65824#true} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {65824#true} is VALID [2022-02-20 23:45:37,992 INFO L272 TraceCheckUtils]: 8: Hoare triple {65824#true} call main_#t~ret34#1 := rand_end_point(); {65824#true} is VALID [2022-02-20 23:45:37,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {65824#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {65824#true} is VALID [2022-02-20 23:45:37,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {65824#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {65834#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:37,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {65834#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {65834#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:37,993 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {65834#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {65824#true} #312#return; {65830#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret34#1|) (<= |ULTIMATE.start_main_#t~ret34#1| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:37,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {65830#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret34#1|) (<= |ULTIMATE.start_main_#t~ret34#1| ~unnamed1~0~LIST_BEG))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {65831#(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:45:37,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {65831#(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: L659 {65831#(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:45:37,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {65831#(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; {65831#(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:45:37,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {65831#(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: L660 {65831#(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:45:37,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {65831#(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; {65831#(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:45:37,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {65831#(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); {65831#(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:45:37,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {65831#(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; {65831#(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:45:37,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {65831#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {65831#(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:45:37,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {65831#(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~ret20#1);havoc remove_one_#t~ret20#1; {65831#(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:45:37,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {65831#(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~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {65832#(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:45:37,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {65832#(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~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {65833#(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:45:38,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {65833#(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~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {65833#(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:45:38,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {65833#(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~ite25#1 := ~unnamed2~0~ITEM_NEXT; {65833#(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:45:38,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {65833#(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~ite25#1;havoc remove_one_#t~ite25#1; {65833#(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:45:38,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {65833#(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~ite26#1 := ~unnamed2~0~ITEM_PREV; {65833#(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:45:38,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {65833#(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~ite26#1;havoc remove_one_#t~ite26#1; {65833#(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:45:38,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {65833#(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); {65825#false} is VALID [2022-02-20 23:45:38,003 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:45:38,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:38,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255530403] [2022-02-20 23:45:38,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255530403] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:38,003 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:38,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:38,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808015588] [2022-02-20 23:45:38,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:38,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:38,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:38,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:38,026 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:45:38,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:38,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:38,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:38,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:38,027 INFO L87 Difference]: Start difference. First operand 510 states and 688 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,323 INFO L93 Difference]: Finished difference Result 1252 states and 1682 transitions. [2022-02-20 23:45:39,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:45:39,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 529 transitions. [2022-02-20 23:45:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 529 transitions. [2022-02-20 23:45:39,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 529 transitions. [2022-02-20 23:45:39,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:39,731 INFO L225 Difference]: With dead ends: 1252 [2022-02-20 23:45:39,731 INFO L226 Difference]: Without dead ends: 1252 [2022-02-20 23:45:39,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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:45:39,731 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 540 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:39,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 1630 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:39,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-02-20 23:45:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 644. [2022-02-20 23:45:39,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:39,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1252 states. Second operand has 644 states, 563 states have (on average 1.5204262877442274) internal successors, (856), 617 states have internal predecessors, (856), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:39,746 INFO L74 IsIncluded]: Start isIncluded. First operand 1252 states. Second operand has 644 states, 563 states have (on average 1.5204262877442274) internal successors, (856), 617 states have internal predecessors, (856), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:39,746 INFO L87 Difference]: Start difference. First operand 1252 states. Second operand has 644 states, 563 states have (on average 1.5204262877442274) internal successors, (856), 617 states have internal predecessors, (856), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,797 INFO L93 Difference]: Finished difference Result 1252 states and 1682 transitions. [2022-02-20 23:45:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1682 transitions. [2022-02-20 23:45:39,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:39,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:39,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 644 states, 563 states have (on average 1.5204262877442274) internal successors, (856), 617 states have internal predecessors, (856), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) Second operand 1252 states. [2022-02-20 23:45:39,800 INFO L87 Difference]: Start difference. First operand has 644 states, 563 states have (on average 1.5204262877442274) internal successors, (856), 617 states have internal predecessors, (856), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) Second operand 1252 states. [2022-02-20 23:45:39,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,868 INFO L93 Difference]: Finished difference Result 1252 states and 1682 transitions. [2022-02-20 23:45:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1682 transitions. [2022-02-20 23:45:39,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:39,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:39,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:39,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 563 states have (on average 1.5204262877442274) internal successors, (856), 617 states have internal predecessors, (856), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 892 transitions. [2022-02-20 23:45:39,890 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 892 transitions. Word has length 30 [2022-02-20 23:45:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:39,891 INFO L470 AbstractCegarLoop]: Abstraction has 644 states and 892 transitions. [2022-02-20 23:45:39,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 892 transitions. [2022-02-20 23:45:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:39,891 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:39,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] [2022-02-20 23:45:39,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-20 23:45:39,892 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1702169087, now seen corresponding path program 1 times [2022-02-20 23:45:39,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:39,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288956620] [2022-02-20 23:45:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:39,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:40,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:40,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {70249#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {70249#true} is VALID [2022-02-20 23:45:40,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {70249#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {70249#true} is VALID [2022-02-20 23:45:40,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {70249#true} assume true; {70249#true} is VALID [2022-02-20 23:45:40,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70249#true} {70251#(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))} #312#return; {70251#(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:45:40,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {70249#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(12, 2);~#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); {70251#(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:45:40,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {70251#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {70251#(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:45:40,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {70251#(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~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {70251#(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:45:40,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {70251#(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 !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {70251#(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:45:40,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {70251#(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~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {70251#(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:45:40,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {70251#(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 !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {70251#(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:45:40,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {70251#(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~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {70251#(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:45:40,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {70251#(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 !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {70251#(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:45:40,029 INFO L272 TraceCheckUtils]: 8: Hoare triple {70251#(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~ret34#1 := rand_end_point(); {70249#true} is VALID [2022-02-20 23:45:40,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {70249#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {70249#true} is VALID [2022-02-20 23:45:40,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {70249#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {70249#true} is VALID [2022-02-20 23:45:40,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {70249#true} assume true; {70249#true} is VALID [2022-02-20 23:45:40,030 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {70249#true} {70251#(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))} #312#return; {70251#(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:45:40,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {70251#(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~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {70256#(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:45:40,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {70256#(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: L659 {70256#(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:45:40,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {70256#(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; {70256#(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:45:40,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {70256#(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: L660 {70256#(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:45:40,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {70256#(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; {70256#(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:45:40,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {70256#(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); {70256#(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:45:40,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {70256#(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; {70256#(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:45:40,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {70256#(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~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {70256#(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:45:40,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {70256#(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~ret20#1);havoc remove_one_#t~ret20#1; {70256#(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:45:40,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {70256#(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~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {70256#(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:45:40,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {70256#(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~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {70256#(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:45:40,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {70256#(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~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {70256#(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:45:40,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {70256#(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~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L707 {70257#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_remove_one_#t~mem23#1.base|)))} is VALID [2022-02-20 23:45:40,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {70257#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_remove_one_#t~mem23#1.base|)))} assume 0 == remove_one_#t~mem23#1.offset; {70257#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_remove_one_#t~mem23#1.base|)))} is VALID [2022-02-20 23:45:40,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {70257#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_remove_one_#t~mem23#1.base|)))} assume remove_one_#t~mem23#1.base < #StackHeapBarrier; {70257#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_remove_one_#t~mem23#1.base|)))} is VALID [2022-02-20 23:45:40,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {70257#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_remove_one_#t~mem23#1.base|)))} assume 0 == remove_one_#t~mem23#1.base || 1 == #valid[remove_one_#t~mem23#1.base];call ULTIMATE.dealloc(remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset);havoc remove_one_#t~mem23#1.base, remove_one_#t~mem23#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; {70258#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:45:40,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {70258#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {70250#false} is VALID [2022-02-20 23:45:40,039 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:45:40,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:40,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288956620] [2022-02-20 23:45:40,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288956620] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:40,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:40,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:40,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731426307] [2022-02-20 23:45:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:40,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:40,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:40,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:40,065 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:45:40,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:40,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:40,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:40,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:40,066 INFO L87 Difference]: Start difference. First operand 644 states and 892 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,528 INFO L93 Difference]: Finished difference Result 1137 states and 1525 transitions. [2022-02-20 23:45:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:41,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:41,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 565 transitions. [2022-02-20 23:45:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 565 transitions. [2022-02-20 23:45:41,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 565 transitions. [2022-02-20 23:45:41,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 565 edges. 565 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:41,965 INFO L225 Difference]: With dead ends: 1137 [2022-02-20 23:45:41,965 INFO L226 Difference]: Without dead ends: 1137 [2022-02-20 23:45:41,966 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:45:41,966 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 470 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:41,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 1053 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:45:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-02-20 23:45:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 687. [2022-02-20 23:45:41,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:41,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1137 states. Second operand has 687 states, 602 states have (on average 1.5016611295681064) internal successors, (904), 657 states have internal predecessors, (904), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:41,983 INFO L74 IsIncluded]: Start isIncluded. First operand 1137 states. Second operand has 687 states, 602 states have (on average 1.5016611295681064) internal successors, (904), 657 states have internal predecessors, (904), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:41,983 INFO L87 Difference]: Start difference. First operand 1137 states. Second operand has 687 states, 602 states have (on average 1.5016611295681064) internal successors, (904), 657 states have internal predecessors, (904), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,038 INFO L93 Difference]: Finished difference Result 1137 states and 1525 transitions. [2022-02-20 23:45:42,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1525 transitions. [2022-02-20 23:45:42,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:42,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:42,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 687 states, 602 states have (on average 1.5016611295681064) internal successors, (904), 657 states have internal predecessors, (904), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) Second operand 1137 states. [2022-02-20 23:45:42,044 INFO L87 Difference]: Start difference. First operand has 687 states, 602 states have (on average 1.5016611295681064) internal successors, (904), 657 states have internal predecessors, (904), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) Second operand 1137 states. [2022-02-20 23:45:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,099 INFO L93 Difference]: Finished difference Result 1137 states and 1525 transitions. [2022-02-20 23:45:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1525 transitions. [2022-02-20 23:45:42,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:42,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:42,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:42,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 602 states have (on average 1.5016611295681064) internal successors, (904), 657 states have internal predecessors, (904), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 946 transitions. [2022-02-20 23:45:42,126 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 946 transitions. Word has length 30 [2022-02-20 23:45:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:42,126 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 946 transitions. [2022-02-20 23:45:42,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 946 transitions. [2022-02-20 23:45:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:42,127 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:42,127 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:45:42,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-20 23:45:42,127 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:42,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:42,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1975675941, now seen corresponding path program 1 times [2022-02-20 23:45:42,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:42,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510900909] [2022-02-20 23:45:42,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:42,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:42,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:42,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {74367#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {74367#true} is VALID [2022-02-20 23:45:42,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {74367#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {74375#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:42,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {74375#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} assume true; {74375#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:42,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74375#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} {74367#true} #312#return; {74373#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret34#1|))} is VALID [2022-02-20 23:45:42,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {74367#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(12, 2);~#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); {74367#true} is VALID [2022-02-20 23:45:42,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {74367#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {74367#true} is VALID [2022-02-20 23:45:42,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {74367#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {74367#true} is VALID [2022-02-20 23:45:42,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {74367#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {74367#true} is VALID [2022-02-20 23:45:42,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {74367#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {74367#true} is VALID [2022-02-20 23:45:42,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {74367#true} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {74367#true} is VALID [2022-02-20 23:45:42,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {74367#true} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {74367#true} is VALID [2022-02-20 23:45:42,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {74367#true} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {74367#true} is VALID [2022-02-20 23:45:42,220 INFO L272 TraceCheckUtils]: 8: Hoare triple {74367#true} call main_#t~ret34#1 := rand_end_point(); {74367#true} is VALID [2022-02-20 23:45:42,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {74367#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {74367#true} is VALID [2022-02-20 23:45:42,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {74367#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {74375#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:42,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {74375#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} assume true; {74375#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:42,221 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {74375#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} {74367#true} #312#return; {74373#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret34#1|))} is VALID [2022-02-20 23:45:42,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {74373#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret34#1|))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:42,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {74374#(not (= ~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: L659 {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:42,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {74374#(not (= ~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; {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:42,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {74374#(not (= ~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: L660 {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:42,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {74374#(not (= ~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; {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:42,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:42,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is_empty_#res#1 := is_empty_~no_beg~0#1; {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:42,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:42,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:42,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:42,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:42,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} assume !(remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:42,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {74374#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} assume ~unnamed1~0~LIST_BEG == remove_one_~from#1;remove_one_#t~ite25#1 := ~unnamed2~0~ITEM_NEXT; {74368#false} is VALID [2022-02-20 23:45:42,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {74368#false} remove_one_~next_field~0#1 := remove_one_#t~ite25#1;havoc remove_one_#t~ite25#1; {74368#false} is VALID [2022-02-20 23:45:42,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {74368#false} assume !(~unnamed1~0~LIST_END == remove_one_~from#1);remove_one_#t~ite26#1 := ~unnamed2~0~ITEM_PREV; {74368#false} is VALID [2022-02-20 23:45:42,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {74368#false} remove_one_~term_field~1#1 := remove_one_#t~ite26#1;havoc remove_one_#t~ite26#1; {74368#false} is VALID [2022-02-20 23:45:42,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {74368#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); {74368#false} is VALID [2022-02-20 23:45:42,226 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:45:42,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:42,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510900909] [2022-02-20 23:45:42,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510900909] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:42,227 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:42,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:42,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514396146] [2022-02-20 23:45:42,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:42,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:42,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:42,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:42,247 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:45:42,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:42,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:42,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:42,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:42,250 INFO L87 Difference]: Start difference. First operand 687 states and 946 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,776 INFO L93 Difference]: Finished difference Result 1055 states and 1417 transitions. [2022-02-20 23:45:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:42,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:42,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 354 transitions. [2022-02-20 23:45:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 354 transitions. [2022-02-20 23:45:42,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 354 transitions. [2022-02-20 23:45:42,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 354 edges. 354 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:43,026 INFO L225 Difference]: With dead ends: 1055 [2022-02-20 23:45:43,026 INFO L226 Difference]: Without dead ends: 1055 [2022-02-20 23:45:43,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:45:43,027 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 226 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:43,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 1134 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:43,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-02-20 23:45:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 679. [2022-02-20 23:45:43,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:43,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1055 states. Second operand has 679 states, 594 states have (on average 1.5016835016835017) internal successors, (892), 649 states have internal predecessors, (892), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:43,038 INFO L74 IsIncluded]: Start isIncluded. First operand 1055 states. Second operand has 679 states, 594 states have (on average 1.5016835016835017) internal successors, (892), 649 states have internal predecessors, (892), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:43,039 INFO L87 Difference]: Start difference. First operand 1055 states. Second operand has 679 states, 594 states have (on average 1.5016835016835017) internal successors, (892), 649 states have internal predecessors, (892), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:43,086 INFO L93 Difference]: Finished difference Result 1055 states and 1417 transitions. [2022-02-20 23:45:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1417 transitions. [2022-02-20 23:45:43,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:43,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:43,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 679 states, 594 states have (on average 1.5016835016835017) internal successors, (892), 649 states have internal predecessors, (892), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) Second operand 1055 states. [2022-02-20 23:45:43,090 INFO L87 Difference]: Start difference. First operand has 679 states, 594 states have (on average 1.5016835016835017) internal successors, (892), 649 states have internal predecessors, (892), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) Second operand 1055 states. [2022-02-20 23:45:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:43,140 INFO L93 Difference]: Finished difference Result 1055 states and 1417 transitions. [2022-02-20 23:45:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1417 transitions. [2022-02-20 23:45:43,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:43,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:43,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:43,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 594 states have (on average 1.5016835016835017) internal successors, (892), 649 states have internal predecessors, (892), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 934 transitions. [2022-02-20 23:45:43,164 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 934 transitions. Word has length 30 [2022-02-20 23:45:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:43,165 INFO L470 AbstractCegarLoop]: Abstraction has 679 states and 934 transitions. [2022-02-20 23:45:43,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 934 transitions. [2022-02-20 23:45:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:43,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:43,166 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:45:43,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-20 23:45:43,166 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:43,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:43,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1977522983, now seen corresponding path program 1 times [2022-02-20 23:45:43,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:43,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329871795] [2022-02-20 23:45:43,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:43,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:43,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:43,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {78224#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {78224#true} is VALID [2022-02-20 23:45:43,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {78224#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {78234#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:43,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {78234#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {78234#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:43,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78234#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {78224#true} #312#return; {78230#(and (<= |ULTIMATE.start_main_#t~ret34#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret34#1|))} is VALID [2022-02-20 23:45:43,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {78224#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(12, 2);~#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); {78224#true} is VALID [2022-02-20 23:45:43,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {78224#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {78224#true} is VALID [2022-02-20 23:45:43,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {78224#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {78224#true} is VALID [2022-02-20 23:45:43,267 INFO L290 TraceCheckUtils]: 3: Hoare triple {78224#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {78224#true} is VALID [2022-02-20 23:45:43,267 INFO L290 TraceCheckUtils]: 4: Hoare triple {78224#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {78224#true} is VALID [2022-02-20 23:45:43,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {78224#true} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {78224#true} is VALID [2022-02-20 23:45:43,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {78224#true} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {78224#true} is VALID [2022-02-20 23:45:43,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {78224#true} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {78224#true} is VALID [2022-02-20 23:45:43,268 INFO L272 TraceCheckUtils]: 8: Hoare triple {78224#true} call main_#t~ret34#1 := rand_end_point(); {78224#true} is VALID [2022-02-20 23:45:43,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {78224#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {78224#true} is VALID [2022-02-20 23:45:43,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {78224#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {78234#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:43,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {78234#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {78234#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:43,269 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {78234#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {78224#true} #312#return; {78230#(and (<= |ULTIMATE.start_main_#t~ret34#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret34#1|))} is VALID [2022-02-20 23:45:43,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {78230#(and (<= |ULTIMATE.start_main_#t~ret34#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret34#1|))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:43,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~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: L659 {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:43,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~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; {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:43,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~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: L660 {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:43,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~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; {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:43,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:43,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is_empty_#res#1 := is_empty_~no_beg~0#1; {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:43,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:43,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:43,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {78231#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {78232#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:43,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {78232#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {78233#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:43,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {78233#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} assume !(remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {78233#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:43,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {78233#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} assume !(~unnamed1~0~LIST_BEG == remove_one_~from#1);remove_one_#t~ite25#1 := ~unnamed2~0~ITEM_PREV; {78233#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:43,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {78233#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} remove_one_~next_field~0#1 := remove_one_#t~ite25#1;havoc remove_one_#t~ite25#1; {78233#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:43,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {78233#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} assume !(~unnamed1~0~LIST_END == remove_one_~from#1);remove_one_#t~ite26#1 := ~unnamed2~0~ITEM_PREV; {78233#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:43,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {78233#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} remove_one_~term_field~1#1 := remove_one_#t~ite26#1;havoc remove_one_#t~ite26#1; {78233#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:43,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {78233#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~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); {78225#false} is VALID [2022-02-20 23:45:43,278 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:45:43,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:43,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329871795] [2022-02-20 23:45:43,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329871795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:43,279 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:43,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:43,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783095657] [2022-02-20 23:45:43,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:43,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:43,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:43,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:43,301 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:45:43,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:43,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:43,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:43,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:43,303 INFO L87 Difference]: Start difference. First operand 679 states and 934 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:44,646 INFO L93 Difference]: Finished difference Result 1259 states and 1668 transitions. [2022-02-20 23:45:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:45:44,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 498 transitions. [2022-02-20 23:45:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 498 transitions. [2022-02-20 23:45:44,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 498 transitions. [2022-02-20 23:45:44,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:45,033 INFO L225 Difference]: With dead ends: 1259 [2022-02-20 23:45:45,034 INFO L226 Difference]: Without dead ends: 1259 [2022-02-20 23:45:45,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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:45:45,034 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 523 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:45,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 1732 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:45,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-02-20 23:45:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 646. [2022-02-20 23:45:45,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:45,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1259 states. Second operand has 646 states, 564 states have (on average 1.4663120567375887) internal successors, (827), 616 states have internal predecessors, (827), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:45,046 INFO L74 IsIncluded]: Start isIncluded. First operand 1259 states. Second operand has 646 states, 564 states have (on average 1.4663120567375887) internal successors, (827), 616 states have internal predecessors, (827), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:45,047 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand has 646 states, 564 states have (on average 1.4663120567375887) internal successors, (827), 616 states have internal predecessors, (827), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:45,095 INFO L93 Difference]: Finished difference Result 1259 states and 1668 transitions. [2022-02-20 23:45:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1668 transitions. [2022-02-20 23:45:45,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:45,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:45,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 646 states, 564 states have (on average 1.4663120567375887) internal successors, (827), 616 states have internal predecessors, (827), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) Second operand 1259 states. [2022-02-20 23:45:45,098 INFO L87 Difference]: Start difference. First operand has 646 states, 564 states have (on average 1.4663120567375887) internal successors, (827), 616 states have internal predecessors, (827), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) Second operand 1259 states. [2022-02-20 23:45:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:45,141 INFO L93 Difference]: Finished difference Result 1259 states and 1668 transitions. [2022-02-20 23:45:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1668 transitions. [2022-02-20 23:45:45,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:45,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:45,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:45,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 564 states have (on average 1.4663120567375887) internal successors, (827), 616 states have internal predecessors, (827), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 869 transitions. [2022-02-20 23:45:45,155 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 869 transitions. Word has length 30 [2022-02-20 23:45:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:45,156 INFO L470 AbstractCegarLoop]: Abstraction has 646 states and 869 transitions. [2022-02-20 23:45:45,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 869 transitions. [2022-02-20 23:45:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:45:45,156 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:45,156 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] [2022-02-20 23:45:45,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-20 23:45:45,156 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:45,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1227634393, now seen corresponding path program 1 times [2022-02-20 23:45:45,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:45,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914425533] [2022-02-20 23:45:45,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:45,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:45,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:45,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {82672#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {82672#true} is VALID [2022-02-20 23:45:45,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {82672#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {82672#true} is VALID [2022-02-20 23:45:45,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {82672#true} assume true; {82672#true} is VALID [2022-02-20 23:45:45,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82672#true} {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #312#return; {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:45,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {82672#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(12, 2);~#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); {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:45,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {82674#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:45,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:45,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:45,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:45,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:45,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:45,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:45,301 INFO L272 TraceCheckUtils]: 8: Hoare triple {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} call main_#t~ret34#1 := rand_end_point(); {82672#true} is VALID [2022-02-20 23:45:45,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {82672#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {82672#true} is VALID [2022-02-20 23:45:45,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {82672#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {82672#true} is VALID [2022-02-20 23:45:45,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {82672#true} assume true; {82672#true} is VALID [2022-02-20 23:45:45,302 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {82672#true} {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #312#return; {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:45,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {82674#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} is VALID [2022-02-20 23:45:45,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} 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: L659 {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} is VALID [2022-02-20 23:45:45,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} 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; {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} is VALID [2022-02-20 23:45:45,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} 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: L660 {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} is VALID [2022-02-20 23:45:45,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} 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; {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} is VALID [2022-02-20 23:45:45,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} is VALID [2022-02-20 23:45:45,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} is_empty_#res#1 := is_empty_~no_beg~0#1; {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} is VALID [2022-02-20 23:45:45,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} is VALID [2022-02-20 23:45:45,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} is VALID [2022-02-20 23:45:45,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {82679#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8))} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {82680#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:45,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {82680#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {82681#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:45,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {82681#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {82681#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:45,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {82681#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L707 {82681#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:45,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {82681#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume 0 == remove_one_#t~mem23#1.offset; {82681#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:45,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {82681#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume remove_one_#t~mem23#1.base < #StackHeapBarrier; {82681#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:45,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {82681#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (= (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) 8) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume 0 == remove_one_#t~mem23#1.base || 1 == #valid[remove_one_#t~mem23#1.base];call ULTIMATE.dealloc(remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset);havoc remove_one_#t~mem23#1.base, remove_one_#t~mem23#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; {82682#(and (<= 0 (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0) (= (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 8))} is VALID [2022-02-20 23:45:45,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {82682#(and (<= 0 (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0) (= (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 8))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {82682#(and (<= 0 (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0) (= (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 8))} is VALID [2022-02-20 23:45:45,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {82682#(and (<= 0 (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0) (= (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 8))} 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); {82673#false} is VALID [2022-02-20 23:45:45,312 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:45:45,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:45,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914425533] [2022-02-20 23:45:45,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914425533] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:45,312 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:45,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:45,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641429293] [2022-02-20 23:45:45,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:45,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 31 [2022-02-20 23:45:45,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:45,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:45:45,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:45,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:45,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:45,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:45,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:45,338 INFO L87 Difference]: Start difference. First operand 646 states and 869 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:45:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:46,568 INFO L93 Difference]: Finished difference Result 925 states and 1194 transitions. [2022-02-20 23:45:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:45:46,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 31 [2022-02-20 23:45:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:45:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 455 transitions. [2022-02-20 23:45:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:45:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 455 transitions. [2022-02-20 23:45:46,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 455 transitions. [2022-02-20 23:45:46,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:46,926 INFO L225 Difference]: With dead ends: 925 [2022-02-20 23:45:46,926 INFO L226 Difference]: Without dead ends: 925 [2022-02-20 23:45:46,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:45:46,927 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 573 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:46,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [573 Valid, 759 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:45:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-02-20 23:45:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 646. [2022-02-20 23:45:46,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:46,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 925 states. Second operand has 646 states, 564 states have (on average 1.4592198581560283) internal successors, (823), 616 states have internal predecessors, (823), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:46,942 INFO L74 IsIncluded]: Start isIncluded. First operand 925 states. Second operand has 646 states, 564 states have (on average 1.4592198581560283) internal successors, (823), 616 states have internal predecessors, (823), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:46,943 INFO L87 Difference]: Start difference. First operand 925 states. Second operand has 646 states, 564 states have (on average 1.4592198581560283) internal successors, (823), 616 states have internal predecessors, (823), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:46,982 INFO L93 Difference]: Finished difference Result 925 states and 1194 transitions. [2022-02-20 23:45:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1194 transitions. [2022-02-20 23:45:46,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:46,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:46,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 646 states, 564 states have (on average 1.4592198581560283) internal successors, (823), 616 states have internal predecessors, (823), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) Second operand 925 states. [2022-02-20 23:45:46,985 INFO L87 Difference]: Start difference. First operand has 646 states, 564 states have (on average 1.4592198581560283) internal successors, (823), 616 states have internal predecessors, (823), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) Second operand 925 states. [2022-02-20 23:45:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:47,025 INFO L93 Difference]: Finished difference Result 925 states and 1194 transitions. [2022-02-20 23:45:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1194 transitions. [2022-02-20 23:45:47,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:47,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:47,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:47,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 564 states have (on average 1.4592198581560283) internal successors, (823), 616 states have internal predecessors, (823), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 865 transitions. [2022-02-20 23:45:47,047 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 865 transitions. Word has length 31 [2022-02-20 23:45:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:47,047 INFO L470 AbstractCegarLoop]: Abstraction has 646 states and 865 transitions. [2022-02-20 23:45:47,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:45:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 865 transitions. [2022-02-20 23:45:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:45:47,048 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:47,048 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:45:47,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-20 23:45:47,049 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:47,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2007870586, now seen corresponding path program 1 times [2022-02-20 23:45:47,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:47,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796916599] [2022-02-20 23:45:47,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:47,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:47,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:47,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {86118#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {86118#true} is VALID [2022-02-20 23:45:47,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {86118#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {86118#true} is VALID [2022-02-20 23:45:47,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {86118#true} assume true; {86118#true} is VALID [2022-02-20 23:45:47,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86118#true} {86120#(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))))} #312#return; {86120#(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:45:47,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {86118#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(12, 2);~#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); {86120#(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:45:47,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {86120#(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~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {86120#(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:45:47,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {86120#(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~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {86120#(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:45:47,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {86120#(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 !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {86120#(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:45:47,230 INFO L290 TraceCheckUtils]: 4: Hoare triple {86120#(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~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {86120#(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:45:47,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {86120#(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 !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {86120#(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:45:47,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {86120#(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~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {86120#(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:45:47,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {86120#(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 !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {86120#(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:45:47,231 INFO L272 TraceCheckUtils]: 8: Hoare triple {86120#(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~ret34#1 := rand_end_point(); {86118#true} is VALID [2022-02-20 23:45:47,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {86118#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {86118#true} is VALID [2022-02-20 23:45:47,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {86118#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {86118#true} is VALID [2022-02-20 23:45:47,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {86118#true} assume true; {86118#true} is VALID [2022-02-20 23:45:47,232 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {86118#true} {86120#(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))))} #312#return; {86120#(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:45:47,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {86120#(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~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {86125#(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:45:47,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {86125#(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: L659 {86125#(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:45:47,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {86125#(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; {86125#(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:45:47,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {86125#(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: L660 {86125#(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:45:47,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {86125#(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; {86125#(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:45:47,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {86125#(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); {86125#(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:45:47,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {86125#(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; {86125#(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:45:47,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {86125#(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~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {86125#(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:45:47,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {86125#(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~ret20#1);havoc remove_one_#t~ret20#1; {86125#(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:45:47,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {86125#(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~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L706 {86126#(and (= |ULTIMATE.start_remove_one_#t~mem21#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~mem21#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:45:47,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {86126#(and (= |ULTIMATE.start_remove_one_#t~mem21#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~mem21#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~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L706-1 {86127#(and (= |ULTIMATE.start_remove_one_#t~mem22#1.offset| |ULTIMATE.start_remove_one_#t~mem21#1.offset|) (= |ULTIMATE.start_remove_one_#t~mem22#1.base| |ULTIMATE.start_remove_one_#t~mem21#1.base|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:47,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {86127#(and (= |ULTIMATE.start_remove_one_#t~mem22#1.offset| |ULTIMATE.start_remove_one_#t~mem21#1.offset|) (= |ULTIMATE.start_remove_one_#t~mem22#1.base| |ULTIMATE.start_remove_one_#t~mem21#1.base|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} assume !(remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {86119#false} is VALID [2022-02-20 23:45:47,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {86119#false} assume ~unnamed1~0~LIST_BEG == remove_one_~from#1;remove_one_#t~ite25#1 := ~unnamed2~0~ITEM_NEXT; {86119#false} is VALID [2022-02-20 23:45:47,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {86119#false} remove_one_~next_field~0#1 := remove_one_#t~ite25#1;havoc remove_one_#t~ite25#1; {86119#false} is VALID [2022-02-20 23:45:47,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {86119#false} assume !(~unnamed1~0~LIST_END == remove_one_~from#1);remove_one_#t~ite26#1 := ~unnamed2~0~ITEM_PREV; {86119#false} is VALID [2022-02-20 23:45:47,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {86119#false} remove_one_~term_field~1#1 := remove_one_#t~ite26#1;havoc remove_one_#t~ite26#1; {86119#false} is VALID [2022-02-20 23:45:47,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {86119#false} SUMMARY for call remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * remove_one_~from#1, 4); srcloc: L713 {86119#false} is VALID [2022-02-20 23:45:47,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {86119#false} remove_one_~item~2#1.base, remove_one_~item~2#1.offset := remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset;havoc remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset; {86119#false} is VALID [2022-02-20 23:45:47,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {86119#false} assume !(1 == #valid[remove_one_~item~2#1.base]); {86119#false} is VALID [2022-02-20 23:45:47,241 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:45:47,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:47,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796916599] [2022-02-20 23:45:47,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796916599] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:47,241 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:47,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:47,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830879119] [2022-02-20 23:45:47,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:47,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 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:45:47,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:47,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 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:45:47,269 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:45:47,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:47,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:47,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:47,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:47,270 INFO L87 Difference]: Start difference. First operand 646 states and 865 transitions. Second operand has 6 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:45:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:48,052 INFO L93 Difference]: Finished difference Result 695 states and 913 transitions. [2022-02-20 23:45:48,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:48,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 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:45:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 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:45:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 275 transitions. [2022-02-20 23:45:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 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:45:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 275 transitions. [2022-02-20 23:45:48,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 275 transitions. [2022-02-20 23:45:48,255 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:45:48,270 INFO L225 Difference]: With dead ends: 695 [2022-02-20 23:45:48,270 INFO L226 Difference]: Without dead ends: 695 [2022-02-20 23:45:48,270 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:45:48,270 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 110 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:48,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 835 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:48,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-02-20 23:45:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 625. [2022-02-20 23:45:48,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:48,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 695 states. Second operand has 625 states, 543 states have (on average 1.4659300184162063) internal successors, (796), 597 states have internal predecessors, (796), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:48,278 INFO L74 IsIncluded]: Start isIncluded. First operand 695 states. Second operand has 625 states, 543 states have (on average 1.4659300184162063) internal successors, (796), 597 states have internal predecessors, (796), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:48,278 INFO L87 Difference]: Start difference. First operand 695 states. Second operand has 625 states, 543 states have (on average 1.4659300184162063) internal successors, (796), 597 states have internal predecessors, (796), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:48,300 INFO L93 Difference]: Finished difference Result 695 states and 913 transitions. [2022-02-20 23:45:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 913 transitions. [2022-02-20 23:45:48,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:48,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:48,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 625 states, 543 states have (on average 1.4659300184162063) internal successors, (796), 597 states have internal predecessors, (796), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) Second operand 695 states. [2022-02-20 23:45:48,302 INFO L87 Difference]: Start difference. First operand has 625 states, 543 states have (on average 1.4659300184162063) internal successors, (796), 597 states have internal predecessors, (796), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) Second operand 695 states. [2022-02-20 23:45:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:48,324 INFO L93 Difference]: Finished difference Result 695 states and 913 transitions. [2022-02-20 23:45:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 913 transitions. [2022-02-20 23:45:48,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:48,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:48,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:48,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 543 states have (on average 1.4659300184162063) internal successors, (796), 597 states have internal predecessors, (796), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 838 transitions. [2022-02-20 23:45:48,344 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 838 transitions. Word has length 32 [2022-02-20 23:45:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:48,345 INFO L470 AbstractCegarLoop]: Abstraction has 625 states and 838 transitions. [2022-02-20 23:45:48,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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:45:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 838 transitions. [2022-02-20 23:45:48,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:45:48,345 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:48,345 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, 1] [2022-02-20 23:45:48,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-20 23:45:48,346 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:48,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:48,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1362637237, now seen corresponding path program 1 times [2022-02-20 23:45:48,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:48,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067573815] [2022-02-20 23:45:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:48,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:48,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {88846#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {88846#true} is VALID [2022-02-20 23:45:48,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {88846#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {88846#true} is VALID [2022-02-20 23:45:48,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {88846#true} assume true; {88846#true} is VALID [2022-02-20 23:45:48,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88846#true} {88846#true} #310#return; {88846#true} is VALID [2022-02-20 23:45:48,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {88846#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(12, 2);~#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); {88846#true} is VALID [2022-02-20 23:45:48,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {88846#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {88846#true} is VALID [2022-02-20 23:45:48,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {88846#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {88846#true} is VALID [2022-02-20 23:45:48,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {88846#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {88846#true} is VALID [2022-02-20 23:45:48,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {88846#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {88846#true} is VALID [2022-02-20 23:45:48,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {88846#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {88846#true} is VALID [2022-02-20 23:45:48,396 INFO L272 TraceCheckUtils]: 6: Hoare triple {88846#true} call main_#t~ret32#1 := rand_end_point(); {88846#true} is VALID [2022-02-20 23:45:48,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {88846#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {88846#true} is VALID [2022-02-20 23:45:48,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {88846#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {88846#true} is VALID [2022-02-20 23:45:48,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {88846#true} assume true; {88846#true} is VALID [2022-02-20 23:45:48,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {88846#true} {88846#true} #310#return; {88846#true} is VALID [2022-02-20 23:45:48,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {88846#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {88846#true} is VALID [2022-02-20 23:45:48,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {88846#true} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {88846#true} is VALID [2022-02-20 23:45:48,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {88846#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; {88846#true} is VALID [2022-02-20 23:45:48,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {88846#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; {88846#true} is VALID [2022-02-20 23:45:48,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {88846#true} havoc create_item_#t~switch6#1; {88846#true} is VALID [2022-02-20 23:45:48,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {88846#true} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {88846#true} is VALID [2022-02-20 23:45:48,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {88846#true} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {88846#true} is VALID [2022-02-20 23:45:48,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {88846#true} assume !create_item_#t~short10#1; {88846#true} is VALID [2022-02-20 23:45:48,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {88846#true} create_item_#t~short12#1 := create_item_#t~short10#1; {88846#true} is VALID [2022-02-20 23:45:48,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {88846#true} assume !create_item_#t~short12#1; {88846#true} is VALID [2022-02-20 23:45:48,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {88846#true} assume !create_item_#t~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {88846#true} is VALID [2022-02-20 23:45:48,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {88846#true} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-13 {88846#true} is VALID [2022-02-20 23:45:48,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {88846#true} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {88846#true} is VALID [2022-02-20 23:45:48,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {88846#true} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L684 {88852#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:48,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {88852#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {88852#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:48,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {88852#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} SUMMARY for call write~$Pointer$(create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-3 {88852#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:48,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {88852#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} havoc create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; {88852#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:48,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {88852#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {88852#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:48,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {88852#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.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; {88853#(= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1)} is VALID [2022-02-20 23:45:48,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {88853#(= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1)} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {88853#(= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1)} is VALID [2022-02-20 23:45:48,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {88853#(= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L688-1 {88853#(= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1)} is VALID [2022-02-20 23:45:48,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {88853#(= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {88854#(= (select |#valid| |ULTIMATE.start_create_item_#res#1.base|) 1)} is VALID [2022-02-20 23:45:48,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {88854#(= (select |#valid| |ULTIMATE.start_create_item_#res#1.base|) 1)} append_one_#t~ret17#1.base, append_one_#t~ret17#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~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; {88855#(= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1)} is VALID [2022-02-20 23:45:48,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {88855#(= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1)} assume !(1 == #valid[append_one_~item~1#1.base]); {88847#false} is VALID [2022-02-20 23:45:48,403 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:45:48,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:48,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067573815] [2022-02-20 23:45:48,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067573815] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:48,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:48,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:48,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067570636] [2022-02-20 23:45:48,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:48,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2022-02-20 23:45:48,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:48,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:48,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:48,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:48,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:48,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:48,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:48,428 INFO L87 Difference]: Start difference. First operand 625 states and 838 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,088 INFO L93 Difference]: Finished difference Result 729 states and 966 transitions. [2022-02-20 23:45:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:49,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2022-02-20 23:45:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 273 transitions. [2022-02-20 23:45:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 273 transitions. [2022-02-20 23:45:49,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 273 transitions. [2022-02-20 23:45:49,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:49,293 INFO L225 Difference]: With dead ends: 729 [2022-02-20 23:45:49,294 INFO L226 Difference]: Without dead ends: 729 [2022-02-20 23:45:49,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:45:49,294 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 468 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:49,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 565 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-02-20 23:45:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 624. [2022-02-20 23:45:49,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:49,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 729 states. Second operand has 624 states, 543 states have (on average 1.4622467771639043) internal successors, (794), 596 states have internal predecessors, (794), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:49,302 INFO L74 IsIncluded]: Start isIncluded. First operand 729 states. Second operand has 624 states, 543 states have (on average 1.4622467771639043) internal successors, (794), 596 states have internal predecessors, (794), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:49,303 INFO L87 Difference]: Start difference. First operand 729 states. Second operand has 624 states, 543 states have (on average 1.4622467771639043) internal successors, (794), 596 states have internal predecessors, (794), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,320 INFO L93 Difference]: Finished difference Result 729 states and 966 transitions. [2022-02-20 23:45:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 966 transitions. [2022-02-20 23:45:49,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:49,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:49,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 624 states, 543 states have (on average 1.4622467771639043) internal successors, (794), 596 states have internal predecessors, (794), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) Second operand 729 states. [2022-02-20 23:45:49,321 INFO L87 Difference]: Start difference. First operand has 624 states, 543 states have (on average 1.4622467771639043) internal successors, (794), 596 states have internal predecessors, (794), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) Second operand 729 states. [2022-02-20 23:45:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,337 INFO L93 Difference]: Finished difference Result 729 states and 966 transitions. [2022-02-20 23:45:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 966 transitions. [2022-02-20 23:45:49,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:49,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:49,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:49,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 543 states have (on average 1.4622467771639043) internal successors, (794), 596 states have internal predecessors, (794), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:49,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 836 transitions. [2022-02-20 23:45:49,353 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 836 transitions. Word has length 35 [2022-02-20 23:45:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:49,353 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 836 transitions. [2022-02-20 23:45:49,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 836 transitions. [2022-02-20 23:45:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:45:49,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:49,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-20 23:45:49,354 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:49,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:49,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1362637238, now seen corresponding path program 1 times [2022-02-20 23:45:49,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:49,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469960636] [2022-02-20 23:45:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:49,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:49,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:49,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {91676#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {91676#true} is VALID [2022-02-20 23:45:49,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {91676#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {91676#true} is VALID [2022-02-20 23:45:49,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {91676#true} assume true; {91676#true} is VALID [2022-02-20 23:45:49,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91676#true} {91676#true} #310#return; {91676#true} is VALID [2022-02-20 23:45:49,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {91676#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(12, 2);~#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); {91676#true} is VALID [2022-02-20 23:45:49,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {91676#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {91676#true} is VALID [2022-02-20 23:45:49,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {91676#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {91676#true} is VALID [2022-02-20 23:45:49,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {91676#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {91676#true} is VALID [2022-02-20 23:45:49,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {91676#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {91676#true} is VALID [2022-02-20 23:45:49,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {91676#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {91676#true} is VALID [2022-02-20 23:45:49,441 INFO L272 TraceCheckUtils]: 6: Hoare triple {91676#true} call main_#t~ret32#1 := rand_end_point(); {91676#true} is VALID [2022-02-20 23:45:49,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {91676#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {91676#true} is VALID [2022-02-20 23:45:49,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {91676#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {91676#true} is VALID [2022-02-20 23:45:49,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {91676#true} assume true; {91676#true} is VALID [2022-02-20 23:45:49,441 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {91676#true} {91676#true} #310#return; {91676#true} is VALID [2022-02-20 23:45:49,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {91676#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {91682#(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:45:49,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {91682#(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); {91682#(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:45:49,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {91682#(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; {91682#(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:45:49,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {91682#(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; {91682#(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:45:49,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {91682#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} havoc create_item_#t~switch6#1; {91682#(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:45:49,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {91682#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {91682#(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:45:49,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {91682#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {91682#(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:45:49,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {91682#(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~short10#1; {91682#(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:45:49,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {91682#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} create_item_#t~short12#1 := create_item_#t~short10#1; {91682#(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:45:49,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {91682#(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~short12#1; {91682#(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:45:49,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {91682#(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~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {91682#(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:45:49,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {91682#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-13 {91682#(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:45:49,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {91682#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {91682#(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:45:49,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {91682#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L684 {91682#(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:45:49,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {91682#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {91682#(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:45:49,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {91682#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} SUMMARY for call write~$Pointer$(create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-3 {91682#(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:45:49,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {91682#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} havoc create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; {91682#(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:45:49,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {91682#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {91682#(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:45:49,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {91682#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.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; {91683#(and (<= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} is VALID [2022-02-20 23:45:49,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {91683#(and (<= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {91683#(and (<= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} is VALID [2022-02-20 23:45:49,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {91683#(and (<= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L688-1 {91683#(and (<= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} is VALID [2022-02-20 23:45:49,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {91683#(and (<= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |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; {91684#(and (<= 265 (select |#length| |ULTIMATE.start_create_item_#res#1.base|)) (= |ULTIMATE.start_create_item_#res#1.offset| 0))} is VALID [2022-02-20 23:45:49,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {91684#(and (<= 265 (select |#length| |ULTIMATE.start_create_item_#res#1.base|)) (= |ULTIMATE.start_create_item_#res#1.offset| 0))} append_one_#t~ret17#1.base, append_one_#t~ret17#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~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; {91685#(and (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|)))} is VALID [2022-02-20 23:45:49,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {91685#(and (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|)))} assume !(4 + (append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV) <= #length[append_one_~item~1#1.base] && 0 <= append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV); {91677#false} is VALID [2022-02-20 23:45:49,454 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:45:49,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:49,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469960636] [2022-02-20 23:45:49,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469960636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:49,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:49,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:49,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599262233] [2022-02-20 23:45:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:49,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2022-02-20 23:45:49,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:49,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:49,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:49,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:49,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:49,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:49,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:49,481 INFO L87 Difference]: Start difference. First operand 624 states and 836 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:50,292 INFO L93 Difference]: Finished difference Result 661 states and 851 transitions. [2022-02-20 23:45:50,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:50,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2022-02-20 23:45:50,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 272 transitions. [2022-02-20 23:45:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 272 transitions. [2022-02-20 23:45:50,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 272 transitions. [2022-02-20 23:45:50,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:50,502 INFO L225 Difference]: With dead ends: 661 [2022-02-20 23:45:50,502 INFO L226 Difference]: Without dead ends: 661 [2022-02-20 23:45:50,502 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:45:50,502 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 496 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:50,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 618 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-02-20 23:45:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 623. [2022-02-20 23:45:50,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:50,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 661 states. Second operand has 623 states, 543 states have (on average 1.4585635359116023) internal successors, (792), 595 states have internal predecessors, (792), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:50,510 INFO L74 IsIncluded]: Start isIncluded. First operand 661 states. Second operand has 623 states, 543 states have (on average 1.4585635359116023) internal successors, (792), 595 states have internal predecessors, (792), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:50,510 INFO L87 Difference]: Start difference. First operand 661 states. Second operand has 623 states, 543 states have (on average 1.4585635359116023) internal successors, (792), 595 states have internal predecessors, (792), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:50,527 INFO L93 Difference]: Finished difference Result 661 states and 851 transitions. [2022-02-20 23:45:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 851 transitions. [2022-02-20 23:45:50,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:50,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:50,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 623 states, 543 states have (on average 1.4585635359116023) internal successors, (792), 595 states have internal predecessors, (792), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) Second operand 661 states. [2022-02-20 23:45:50,529 INFO L87 Difference]: Start difference. First operand has 623 states, 543 states have (on average 1.4585635359116023) internal successors, (792), 595 states have internal predecessors, (792), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) Second operand 661 states. [2022-02-20 23:45:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:50,545 INFO L93 Difference]: Finished difference Result 661 states and 851 transitions. [2022-02-20 23:45:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 851 transitions. [2022-02-20 23:45:50,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:50,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:50,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:50,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 543 states have (on average 1.4585635359116023) internal successors, (792), 595 states have internal predecessors, (792), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 834 transitions. [2022-02-20 23:45:50,558 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 834 transitions. Word has length 35 [2022-02-20 23:45:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:50,558 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 834 transitions. [2022-02-20 23:45:50,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 834 transitions. [2022-02-20 23:45:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 23:45:50,558 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:50,558 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, 1, 1, 1] [2022-02-20 23:45:50,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-20 23:45:50,559 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:45:50,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash -470637162, now seen corresponding path program 1 times [2022-02-20 23:45:50,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:50,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054947748] [2022-02-20 23:45:50,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:50,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:50,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {94301#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {94301#true} is VALID [2022-02-20 23:45:50,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {94301#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {94301#true} is VALID [2022-02-20 23:45:50,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {94301#true} assume true; {94301#true} is VALID [2022-02-20 23:45:50,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94301#true} {94301#true} #310#return; {94301#true} is VALID [2022-02-20 23:45:50,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {94301#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(12, 2);~#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); {94301#true} is VALID [2022-02-20 23:45:50,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {94301#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {94301#true} is VALID [2022-02-20 23:45:50,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {94301#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {94301#true} is VALID [2022-02-20 23:45:50,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {94301#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {94301#true} is VALID [2022-02-20 23:45:50,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {94301#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {94301#true} is VALID [2022-02-20 23:45:50,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {94301#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {94301#true} is VALID [2022-02-20 23:45:50,607 INFO L272 TraceCheckUtils]: 6: Hoare triple {94301#true} call main_#t~ret32#1 := rand_end_point(); {94301#true} is VALID [2022-02-20 23:45:50,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {94301#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {94301#true} is VALID [2022-02-20 23:45:50,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {94301#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {94301#true} is VALID [2022-02-20 23:45:50,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {94301#true} assume true; {94301#true} is VALID [2022-02-20 23:45:50,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94301#true} {94301#true} #310#return; {94301#true} is VALID [2022-02-20 23:45:50,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {94301#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#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~ret32#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, 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;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#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_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#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_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#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; {94307#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:45:50,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {94307#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {94307#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:45:50,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {94307#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#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; {94307#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:45:50,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {94307#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#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; {94307#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:45:50,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {94307#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} havoc create_item_#t~switch6#1; {94307#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:45:50,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {94307#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-12 {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} assume !create_item_#t~short10#1; {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} create_item_#t~short12#1 := create_item_#t~short10#1; {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} assume !create_item_#t~short12#1; {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} assume !create_item_#t~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L681-13 {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L684 {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} SUMMARY for call write~$Pointer$(create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L685-3 {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} havoc create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L686 {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.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; {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:45:50,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {94308#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L688-1 {94309#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:45:50,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {94309#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {94309#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:45:50,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {94309#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} append_one_#t~ret17#1.base, append_one_#t~ret17#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~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; {94309#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:45:50,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {94309#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} SUMMARY for call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L697 {94309#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:45:50,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {94309#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} assume 0 == append_one_#t~mem18#1.base && 0 == append_one_#t~mem18#1.offset;havoc append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset; {94309#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:45:50,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {94309#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} assume !(1 == #valid[append_one_~list#1.base]); {94302#false} is VALID [2022-02-20 23:45:50,619 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:45:50,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:50,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054947748] [2022-02-20 23:45:50,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054947748] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:50,620 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:50,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:50,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193217588] [2022-02-20 23:45:50,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:50,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 37 [2022-02-20 23:45:50,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:50,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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:45:50,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:50,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:50,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:50,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:50,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:50,648 INFO L87 Difference]: Start difference. First operand 623 states and 834 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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:45:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:51,222 INFO L93 Difference]: Finished difference Result 1070 states and 1398 transitions. [2022-02-20 23:45:51,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:51,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 37 [2022-02-20 23:45:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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)