./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:59:45,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:59:45,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:59:45,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:59:45,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:59:45,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:59:45,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:59:45,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:59:45,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:59:45,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:59:45,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:59:45,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:59:45,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:59:45,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:59:45,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:59:45,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:59:45,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:59:45,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:59:45,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:59:45,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:59:45,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:59:45,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:59:45,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:59:45,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:59:45,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:59:45,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:59:45,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:59:45,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:59:45,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:59:45,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:59:45,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:59:45,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:59:45,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:59:45,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:59:45,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:59:45,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:59:45,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:59:45,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:59:45,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:59:45,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:59:45,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:59:45,555 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:59:45,570 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:59:45,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:59:45,573 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:59:45,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:59:45,574 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:59:45,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:59:45,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:59:45,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:59:45,575 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:59:45,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:59:45,576 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:59:45,576 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:59:45,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:59:45,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:59:45,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:59:45,577 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:59:45,577 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:59:45,577 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:59:45,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:59:45,578 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:59:45,578 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:59:45,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:59:45,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:59:45,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:59:45,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:59:45,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:59:45,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:59:45,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:59:45,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:59:45,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:59:45,579 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2022-02-20 23:59:45,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:59:45,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:59:45,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:59:45,794 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:59:45,796 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:59:45,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-02-20 23:59:45,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dae48550/4391cd5f15704f149d9be4583d5d70e3/FLAGd7a5cb146 [2022-02-20 23:59:46,197 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:59:46,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-02-20 23:59:46,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dae48550/4391cd5f15704f149d9be4583d5d70e3/FLAGd7a5cb146 [2022-02-20 23:59:46,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dae48550/4391cd5f15704f149d9be4583d5d70e3 [2022-02-20 23:59:46,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:59:46,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:59:46,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:59:46,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:59:46,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:59:46,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:46" (1/1) ... [2022-02-20 23:59:46,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f997855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:46, skipping insertion in model container [2022-02-20 23:59:46,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:46" (1/1) ... [2022-02-20 23:59:46,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:59:46,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:59:46,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-02-20 23:59:46,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:59:46,497 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:59:46,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-02-20 23:59:46,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:59:46,559 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:59:46,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:46 WrapperNode [2022-02-20 23:59:46,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:59:46,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:59:46,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:59:46,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:59:46,568 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:59:46" (1/1) ... [2022-02-20 23:59:46,578 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:59:46" (1/1) ... [2022-02-20 23:59:46,602 INFO L137 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 151 [2022-02-20 23:59:46,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:59:46,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:59:46,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:59:46,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:59:46,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:46" (1/1) ... [2022-02-20 23:59:46,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:46" (1/1) ... [2022-02-20 23:59:46,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:46" (1/1) ... [2022-02-20 23:59:46,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:46" (1/1) ... [2022-02-20 23:59:46,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:46" (1/1) ... [2022-02-20 23:59:46,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:46" (1/1) ... [2022-02-20 23:59:46,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:46" (1/1) ... [2022-02-20 23:59:46,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:59:46,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:59:46,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:59:46,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:59:46,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:46" (1/1) ... [2022-02-20 23:59:46,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:59:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:46,698 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:59:46,699 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:59:46,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:59:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:59:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 23:59:46,729 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 23:59:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:59:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:59:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:59:46,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:59:46,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:59:46,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:59:46,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:59:46,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:59:46,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:59:46,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:59:46,830 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:59:46,831 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:59:47,223 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:59:47,230 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:59:47,230 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:59:47,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:47 BoogieIcfgContainer [2022-02-20 23:59:47,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:59:47,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:59:47,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:59:47,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:59:47,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:59:46" (1/3) ... [2022-02-20 23:59:47,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edf57d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:47, skipping insertion in model container [2022-02-20 23:59:47,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:46" (2/3) ... [2022-02-20 23:59:47,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edf57d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:47, skipping insertion in model container [2022-02-20 23:59:47,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:47" (3/3) ... [2022-02-20 23:59:47,265 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2022-02-20 23:59:47,275 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:59:47,276 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-02-20 23:59:47,317 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:59:47,323 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:59:47,323 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-02-20 23:59:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 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:59:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:59:47,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:47,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:47,358 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1814951417, now seen corresponding path program 1 times [2022-02-20 23:59:47,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:47,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735207686] [2022-02-20 23:59:47,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:47,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:47,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {102#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(23, 2); {102#true} is VALID [2022-02-20 23:59:47,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {102#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {102#true} is VALID [2022-02-20 23:59:47,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {102#true} assume !!(sll_create_~len#1 > 0); {102#true} is VALID [2022-02-20 23:59:47,606 INFO L272 TraceCheckUtils]: 3: Hoare triple {102#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {102#true} is VALID [2022-02-20 23:59:47,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {102#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {104#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:47,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {104#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {104#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:47,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {104#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(1 == #valid[~temp~0#1.base]); {103#false} is VALID [2022-02-20 23:59:47,611 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:59:47,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:47,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735207686] [2022-02-20 23:59:47,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735207686] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:47,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:47,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:59:47,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779488868] [2022-02-20 23:59:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:47,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:59:47,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:47,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:47,636 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:59:47,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:47,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:47,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:47,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:47,671 INFO L87 Difference]: Start difference. First operand has 99 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 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 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:47,949 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-02-20 23:59:47,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:47,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:59:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-02-20 23:59:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-02-20 23:59:47,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-02-20 23:59:48,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:48,072 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:59:48,073 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 23:59:48,074 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:59:48,078 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:48,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 158 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 23:59:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-02-20 23:59:48,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:48,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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:59:48,115 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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:59:48,117 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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:59:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:48,122 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-02-20 23:59:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:59:48,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:48,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:48,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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 94 states. [2022-02-20 23:59:48,124 INFO L87 Difference]: Start difference. First operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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 94 states. [2022-02-20 23:59:48,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:48,129 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-02-20 23:59:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:59:48,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:48,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:48,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:48,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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:59:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-02-20 23:59:48,134 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 7 [2022-02-20 23:59:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:48,135 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-02-20 23:59:48,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:59:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:59:48,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:48,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:48,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:59:48,136 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1814951418, now seen corresponding path program 1 times [2022-02-20 23:59:48,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:48,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176154988] [2022-02-20 23:59:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:48,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {486#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(23, 2); {486#true} is VALID [2022-02-20 23:59:48,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {486#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {486#true} is VALID [2022-02-20 23:59:48,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {486#true} assume !!(sll_create_~len#1 > 0); {486#true} is VALID [2022-02-20 23:59:48,191 INFO L272 TraceCheckUtils]: 3: Hoare triple {486#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {486#true} is VALID [2022-02-20 23:59:48,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {486#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {488#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:59:48,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {488#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {488#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:59:48,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {488#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} assume !(4 + (4 + ~temp~0#1.offset) <= #length[~temp~0#1.base] && 0 <= 4 + ~temp~0#1.offset); {487#false} is VALID [2022-02-20 23:59:48,193 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:59:48,193 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:48,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176154988] [2022-02-20 23:59:48,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176154988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:48,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:48,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:59:48,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909688195] [2022-02-20 23:59:48,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:48,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:59:48,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:48,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:48,201 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:59:48,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:48,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:48,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:48,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:48,203 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:48,336 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-02-20 23:59:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:48,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:59:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-20 23:59:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-20 23:59:48,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2022-02-20 23:59:48,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:48,431 INFO L225 Difference]: With dead ends: 92 [2022-02-20 23:59:48,432 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 23:59:48,432 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:59:48,433 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:48,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 158 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:48,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 23:59:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-20 23:59:48,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:48,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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:59:48,450 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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:59:48,451 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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:59:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:48,459 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-02-20 23:59:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-02-20 23:59:48,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:48,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:48,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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 92 states. [2022-02-20 23:59:48,464 INFO L87 Difference]: Start difference. First operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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 92 states. [2022-02-20 23:59:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:48,468 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-02-20 23:59:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-02-20 23:59:48,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:48,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:48,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:48,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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:59:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-02-20 23:59:48,475 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 7 [2022-02-20 23:59:48,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:48,476 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-02-20 23:59:48,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-02-20 23:59:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:59:48,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:48,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:48,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:59:48,477 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:48,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1506390976, now seen corresponding path program 1 times [2022-02-20 23:59:48,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:48,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227960802] [2022-02-20 23:59:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:48,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:48,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:59:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:48,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {870#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {859#true} is VALID [2022-02-20 23:59:48,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {859#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {859#true} is VALID [2022-02-20 23:59:48,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {859#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {871#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:48,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {871#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {871#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:48,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {871#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {872#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:48,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {872#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:48,596 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {872#(= (select |#valid| |node_create_#res#1.base|) 1)} {859#true} #185#return; {868#(= (select |#valid| |ULTIMATE.start_sll_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:59:48,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {859#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(23, 2); {859#true} is VALID [2022-02-20 23:59:48,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {859#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {859#true} is VALID [2022-02-20 23:59:48,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {859#true} assume !!(sll_create_~len#1 > 0); {859#true} is VALID [2022-02-20 23:59:48,597 INFO L272 TraceCheckUtils]: 3: Hoare triple {859#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {870#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:48,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {870#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {859#true} is VALID [2022-02-20 23:59:48,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {859#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {859#true} is VALID [2022-02-20 23:59:48,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {859#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {871#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:48,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {871#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {871#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:48,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {871#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {872#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:48,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {872#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:48,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {872#(= (select |#valid| |node_create_#res#1.base|) 1)} {859#true} #185#return; {868#(= (select |#valid| |ULTIMATE.start_sll_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:59:48,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {868#(= (select |#valid| |ULTIMATE.start_sll_create_#t~ret5#1.base|) 1)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {869#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:59:48,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {869#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} assume !(1 == #valid[sll_create_~new_head~0#1.base]); {860#false} is VALID [2022-02-20 23:59:48,602 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:59:48,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:48,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227960802] [2022-02-20 23:59:48,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227960802] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:48,603 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:48,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:59:48,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706089715] [2022-02-20 23:59:48,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:48,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 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 13 [2022-02-20 23:59:48,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:48,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:48,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:48,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:59:48,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:48,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:59:48,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:59:48,618 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:49,137 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-02-20 23:59:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:59:49,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 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 13 [2022-02-20 23:59:49,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-02-20 23:59:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-02-20 23:59:49,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 109 transitions. [2022-02-20 23:59:49,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:49,216 INFO L225 Difference]: With dead ends: 96 [2022-02-20 23:59:49,216 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 23:59:49,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:59:49,217 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 11 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:49,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 369 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:59:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 23:59:49,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-02-20 23:59:49,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:49,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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:59:49,227 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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:59:49,227 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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:59:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:49,230 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-02-20 23:59:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-02-20 23:59:49,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:49,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:49,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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 96 states. [2022-02-20 23:59:49,232 INFO L87 Difference]: Start difference. First operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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 96 states. [2022-02-20 23:59:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:49,237 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-02-20 23:59:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-02-20 23:59:49,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:49,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:49,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:49,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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:59:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-02-20 23:59:49,241 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 13 [2022-02-20 23:59:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:49,242 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-02-20 23:59:49,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-02-20 23:59:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:59:49,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:49,243 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:49,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:59:49,243 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:49,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1506390975, now seen corresponding path program 1 times [2022-02-20 23:59:49,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:49,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397146618] [2022-02-20 23:59:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:49,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:49,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:59:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:49,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {1267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:49,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:49,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:49,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:49,375 INFO L290 TraceCheckUtils]: 4: Hoare triple {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1269#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} is VALID [2022-02-20 23:59:49,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {1269#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} assume true; {1269#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} is VALID [2022-02-20 23:59:49,376 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1269#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} {1256#true} #185#return; {1265#(and (= |ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_sll_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:49,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {1256#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(23, 2); {1256#true} is VALID [2022-02-20 23:59:49,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {1256#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1256#true} is VALID [2022-02-20 23:59:49,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {1256#true} assume !!(sll_create_~len#1 > 0); {1256#true} is VALID [2022-02-20 23:59:49,377 INFO L272 TraceCheckUtils]: 3: Hoare triple {1256#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {1267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:49,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {1267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:49,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:49,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:49,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:49,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {1268#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1269#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} is VALID [2022-02-20 23:59:49,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {1269#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} assume true; {1269#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} is VALID [2022-02-20 23:59:49,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1269#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} {1256#true} #185#return; {1265#(and (= |ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_sll_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:49,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {1265#(and (= |ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_sll_create_#t~ret5#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {1266#(and (= (+ (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:59:49,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {1266#(and (= (+ (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} assume !(4 + (4 + sll_create_~new_head~0#1.offset) <= #length[sll_create_~new_head~0#1.base] && 0 <= 4 + sll_create_~new_head~0#1.offset); {1257#false} is VALID [2022-02-20 23:59:49,383 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:59:49,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:49,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397146618] [2022-02-20 23:59:49,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397146618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:49,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:49,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:59:49,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107410451] [2022-02-20 23:59:49,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:49,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 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 13 [2022-02-20 23:59:49,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:49,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:49,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:49,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:59:49,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:49,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:59:49,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:59:49,394 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:49,889 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-02-20 23:59:49,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:59:49,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 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 13 [2022-02-20 23:59:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2022-02-20 23:59:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2022-02-20 23:59:49,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 108 transitions. [2022-02-20 23:59:49,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:49,963 INFO L225 Difference]: With dead ends: 95 [2022-02-20 23:59:49,963 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 23:59:49,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:59:49,964 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 9 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:49,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 385 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:59:49,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 23:59:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2022-02-20 23:59:49,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:49,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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:59:49,969 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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:59:49,969 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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:59:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:49,971 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-02-20 23:59:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-02-20 23:59:49,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:49,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:49,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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 95 states. [2022-02-20 23:59:49,972 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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 95 states. [2022-02-20 23:59:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:49,974 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-02-20 23:59:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-02-20 23:59:49,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:49,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:49,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:49,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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:59:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-02-20 23:59:49,977 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 13 [2022-02-20 23:59:49,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:49,977 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-02-20 23:59:49,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-02-20 23:59:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:59:49,978 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:49,978 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:49,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:59:49,980 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:49,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2068593344, now seen corresponding path program 1 times [2022-02-20 23:59:49,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:49,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090147479] [2022-02-20 23:59:49,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:49,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:50,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 23:59:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:50,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {1659#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1649#true} is VALID [2022-02-20 23:59:50,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {1649#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1649#true} is VALID [2022-02-20 23:59:50,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {1649#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {1649#true} is VALID [2022-02-20 23:59:50,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {1649#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {1649#true} is VALID [2022-02-20 23:59:50,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {1649#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1649#true} is VALID [2022-02-20 23:59:50,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {1649#true} assume true; {1649#true} is VALID [2022-02-20 23:59:50,022 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1649#true} {1650#false} #187#return; {1650#false} is VALID [2022-02-20 23:59:50,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {1649#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(23, 2); {1649#true} is VALID [2022-02-20 23:59:50,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {1649#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1651#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:50,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !(sll_create_~len#1 > 0); {1650#false} is VALID [2022-02-20 23:59:50,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {1650#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1650#false} is VALID [2022-02-20 23:59:50,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {1650#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {1650#false} is VALID [2022-02-20 23:59:50,024 INFO L272 TraceCheckUtils]: 5: Hoare triple {1650#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {1659#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:50,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {1659#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1649#true} is VALID [2022-02-20 23:59:50,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1649#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1649#true} is VALID [2022-02-20 23:59:50,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {1649#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {1649#true} is VALID [2022-02-20 23:59:50,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {1649#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {1649#true} is VALID [2022-02-20 23:59:50,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {1649#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1649#true} is VALID [2022-02-20 23:59:50,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {1649#true} assume true; {1649#true} is VALID [2022-02-20 23:59:50,025 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1649#true} {1650#false} #187#return; {1650#false} is VALID [2022-02-20 23:59:50,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {1650#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0; {1650#false} is VALID [2022-02-20 23:59:50,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {1650#false} assume !(1 == #valid[sll_insert_~head#1.base]); {1650#false} is VALID [2022-02-20 23:59:50,026 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:59:50,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:50,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090147479] [2022-02-20 23:59:50,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090147479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:50,026 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:50,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:59:50,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923596762] [2022-02-20 23:59:50,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:50,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:59:50,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:50,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:59:50,037 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:59:50,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:59:50,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:50,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:59:50,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:59:50,038 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:59:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:50,217 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 23:59:50,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:59:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:59:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:59:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-02-20 23:59:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:59:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-02-20 23:59:50,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-02-20 23:59:50,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:50,292 INFO L225 Difference]: With dead ends: 96 [2022-02-20 23:59:50,292 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 23:59:50,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:59:50,293 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:50,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 234 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:50,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 23:59:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-02-20 23:59:50,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:50,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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:59:50,297 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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:59:50,297 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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:59:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:50,300 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 23:59:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-20 23:59:50,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:50,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:50,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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 96 states. [2022-02-20 23:59:50,301 INFO L87 Difference]: Start difference. First operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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 96 states. [2022-02-20 23:59:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:50,303 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 23:59:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-20 23:59:50,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:50,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:50,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:50,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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:59:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-02-20 23:59:50,306 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 15 [2022-02-20 23:59:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:50,307 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-02-20 23:59:50,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:59:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-02-20 23:59:50,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:59:50,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:50,308 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:50,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:59:50,308 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:50,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:50,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1769802942, now seen corresponding path program 1 times [2022-02-20 23:59:50,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:50,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565247573] [2022-02-20 23:59:50,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:50,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:59:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:50,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {2059#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {2041#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2041#true} is VALID [2022-02-20 23:59:50,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {2041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2041#true} is VALID [2022-02-20 23:59:50,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {2041#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2041#true} is VALID [2022-02-20 23:59:50,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {2041#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {2041#true} assume true; {2041#true} is VALID [2022-02-20 23:59:50,392 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2041#true} {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} #185#return; {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:50,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 23:59:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:50,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {2059#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {2041#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2041#true} is VALID [2022-02-20 23:59:50,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {2041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2041#true} is VALID [2022-02-20 23:59:50,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {2041#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2041#true} is VALID [2022-02-20 23:59:50,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {2041#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {2041#true} assume true; {2041#true} is VALID [2022-02-20 23:59:50,411 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2041#true} {2042#false} #187#return; {2042#false} is VALID [2022-02-20 23:59:50,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {2041#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(23, 2); {2041#true} is VALID [2022-02-20 23:59:50,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {2041#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:50,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !!(sll_create_~len#1 > 0); {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:50,413 INFO L272 TraceCheckUtils]: 3: Hoare triple {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2059#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:50,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {2059#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {2041#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2041#true} is VALID [2022-02-20 23:59:50,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {2041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2041#true} is VALID [2022-02-20 23:59:50,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {2041#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2041#true} is VALID [2022-02-20 23:59:50,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {2041#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {2041#true} assume true; {2041#true} is VALID [2022-02-20 23:59:50,416 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2041#true} {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} #185#return; {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:50,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:50,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L588 {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:50,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:50,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {2043#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2051#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {2051#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {2042#false} is VALID [2022-02-20 23:59:50,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {2042#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2042#false} is VALID [2022-02-20 23:59:50,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {2042#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {2042#false} is VALID [2022-02-20 23:59:50,421 INFO L272 TraceCheckUtils]: 18: Hoare triple {2042#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {2059#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:50,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {2059#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {2041#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2041#true} is VALID [2022-02-20 23:59:50,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {2041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2041#true} is VALID [2022-02-20 23:59:50,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {2041#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2041#true} is VALID [2022-02-20 23:59:50,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {2041#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {2041#true} assume true; {2041#true} is VALID [2022-02-20 23:59:50,422 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2041#true} {2042#false} #187#return; {2042#false} is VALID [2022-02-20 23:59:50,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {2042#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0; {2042#false} is VALID [2022-02-20 23:59:50,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {2042#false} assume !(1 == #valid[sll_insert_~head#1.base]); {2042#false} is VALID [2022-02-20 23:59:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:59:50,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:50,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565247573] [2022-02-20 23:59:50,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565247573] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:50,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011640739] [2022-02-20 23:59:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:50,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:50,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:50,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:50,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:59:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:50,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:59:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:50,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:50,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {2041#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(23, 2); {2041#true} is VALID [2022-02-20 23:59:50,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {2041#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0); {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,710 INFO L272 TraceCheckUtils]: 3: Hoare triple {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2041#true} is VALID [2022-02-20 23:59:50,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {2041#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {2041#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2041#true} is VALID [2022-02-20 23:59:50,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {2041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2041#true} is VALID [2022-02-20 23:59:50,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {2041#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2041#true} is VALID [2022-02-20 23:59:50,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {2041#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {2041#true} assume true; {2041#true} is VALID [2022-02-20 23:59:50,711 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2041#true} {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} #185#return; {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L588 {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2051#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {2051#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {2042#false} is VALID [2022-02-20 23:59:50,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {2042#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2042#false} is VALID [2022-02-20 23:59:50,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {2042#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {2042#false} is VALID [2022-02-20 23:59:50,713 INFO L272 TraceCheckUtils]: 18: Hoare triple {2042#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {2042#false} is VALID [2022-02-20 23:59:50,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {2042#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2042#false} is VALID [2022-02-20 23:59:50,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {2042#false} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2042#false} is VALID [2022-02-20 23:59:50,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {2042#false} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2042#false} is VALID [2022-02-20 23:59:50,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {2042#false} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2042#false} is VALID [2022-02-20 23:59:50,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {2042#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2042#false} is VALID [2022-02-20 23:59:50,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {2042#false} assume true; {2042#false} is VALID [2022-02-20 23:59:50,714 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2042#false} {2042#false} #187#return; {2042#false} is VALID [2022-02-20 23:59:50,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {2042#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0; {2042#false} is VALID [2022-02-20 23:59:50,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {2042#false} assume !(1 == #valid[sll_insert_~head#1.base]); {2042#false} is VALID [2022-02-20 23:59:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:50,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:50,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {2042#false} assume !(1 == #valid[sll_insert_~head#1.base]); {2042#false} is VALID [2022-02-20 23:59:50,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {2042#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0; {2042#false} is VALID [2022-02-20 23:59:50,844 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2041#true} {2042#false} #187#return; {2042#false} is VALID [2022-02-20 23:59:50,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {2041#true} assume true; {2041#true} is VALID [2022-02-20 23:59:50,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {2041#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {2041#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2041#true} is VALID [2022-02-20 23:59:50,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {2041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2041#true} is VALID [2022-02-20 23:59:50,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {2041#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2041#true} is VALID [2022-02-20 23:59:50,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {2041#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,845 INFO L272 TraceCheckUtils]: 18: Hoare triple {2042#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {2041#true} is VALID [2022-02-20 23:59:50,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {2042#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {2042#false} is VALID [2022-02-20 23:59:50,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {2042#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2042#false} is VALID [2022-02-20 23:59:50,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {2051#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {2042#false} is VALID [2022-02-20 23:59:50,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2051#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L588 {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,848 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2041#true} {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} #185#return; {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {2041#true} assume true; {2041#true} is VALID [2022-02-20 23:59:50,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {2041#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {2041#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2041#true} is VALID [2022-02-20 23:59:50,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {2041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2041#true} is VALID [2022-02-20 23:59:50,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {2041#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2041#true} is VALID [2022-02-20 23:59:50,855 INFO L290 TraceCheckUtils]: 4: Hoare triple {2041#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2041#true} is VALID [2022-02-20 23:59:50,856 INFO L272 TraceCheckUtils]: 3: Hoare triple {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2041#true} is VALID [2022-02-20 23:59:50,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0); {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {2041#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2066#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:50,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {2041#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(23, 2); {2041#true} is VALID [2022-02-20 23:59:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:59:50,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011640739] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:50,857 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:59:50,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-02-20 23:59:50,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943410474] [2022-02-20 23:59:50,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:50,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 23:59:50,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:50,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:50,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:50,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:59:50,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:50,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:59:50,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:50,886 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:51,110 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-02-20 23:59:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:59:51,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 23:59:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-02-20 23:59:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-02-20 23:59:51,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 108 transitions. [2022-02-20 23:59:51,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:51,180 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:59:51,180 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 23:59:51,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:51,180 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 8 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:51,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 326 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 23:59:51,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-02-20 23:59:51,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:51,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:51,184 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:51,184 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:51,186 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-02-20 23:59:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-02-20 23:59:51,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:51,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:51,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 97 states. [2022-02-20 23:59:51,187 INFO L87 Difference]: Start difference. First operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 97 states. [2022-02-20 23:59:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:51,189 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-02-20 23:59:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-02-20 23:59:51,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:51,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:51,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:51,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-02-20 23:59:51,191 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 28 [2022-02-20 23:59:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:51,191 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-02-20 23:59:51,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-02-20 23:59:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:59:51,192 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:51,192 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:51,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 23:59:51,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 23:59:51,411 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:51,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash -888530816, now seen corresponding path program 2 times [2022-02-20 23:59:51,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:51,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140784465] [2022-02-20 23:59:51,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:59:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:51,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {2639#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:51,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:51,568 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #185#return; {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:51,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 23:59:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:51,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {2639#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:51,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:51,615 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #185#return; {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:51,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-20 23:59:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:51,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {2639#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:51,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:51,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:51,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:51,675 INFO L290 TraceCheckUtils]: 4: Hoare triple {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2643#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:51,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {2643#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2643#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:51,677 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2643#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2631#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)} #187#return; {2631#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)} is VALID [2022-02-20 23:59:51,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#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(23, 2); {2613#true} is VALID [2022-02-20 23:59:51,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {2613#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:51,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !!(sll_create_~len#1 > 0); {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:51,679 INFO L272 TraceCheckUtils]: 3: Hoare triple {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2639#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:51,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {2639#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:51,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:51,687 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #185#return; {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:51,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:51,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L588 {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:51,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:51,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:51,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !!(sll_create_~len#1 > 0); {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:51,689 INFO L272 TraceCheckUtils]: 16: Hoare triple {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2639#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:51,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {2639#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:51,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {2640#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:51,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:51,694 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2641#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2615#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #185#return; {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:51,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:51,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L588 {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:51,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:51,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:51,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(sll_create_~len#1 > 0); {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:51,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:51,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {2630#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {2631#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)} is VALID [2022-02-20 23:59:51,697 INFO L272 TraceCheckUtils]: 31: Hoare triple {2631#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {2639#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:51,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {2639#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:51,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:51,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:51,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L580 {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:51,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {2642#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2643#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:51,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {2643#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2643#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:51,701 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2643#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2631#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)} #187#return; {2631#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)} is VALID [2022-02-20 23:59:51,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {2631#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0; {2631#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)} is VALID [2022-02-20 23:59:51,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {2631#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)} assume !(1 == #valid[sll_insert_~head#1.base]); {2614#false} is VALID [2022-02-20 23:59:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 23:59:51,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:51,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140784465] [2022-02-20 23:59:51,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140784465] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:51,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717311274] [2022-02-20 23:59:51,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:59:51,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:51,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:51,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:51,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:59:51,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:59:51,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:59:51,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 23:59:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:51,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:51,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:51,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:59:52,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:59:52,325 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:59:52,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-20 23:59:52,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:59:52,716 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 23:59:52,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 23:59:52,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-02-20 23:59:52,917 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 94651 column 46: unknown constant v_#valid_BEFORE_CALL_6 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 23:59:52,921 INFO L158 Benchmark]: Toolchain (without parser) took 6693.31ms. Allocated memory was 107.0MB in the beginning and 174.1MB in the end (delta: 67.1MB). Free memory was 66.7MB in the beginning and 83.7MB in the end (delta: -17.0MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2022-02-20 23:59:52,921 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 107.0MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:59:52,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.06ms. Allocated memory is still 107.0MB. Free memory was 66.5MB in the beginning and 72.5MB in the end (delta: -6.1MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-02-20 23:59:52,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.81ms. Allocated memory is still 107.0MB. Free memory was 72.5MB in the beginning and 69.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:59:52,922 INFO L158 Benchmark]: Boogie Preprocessor took 54.93ms. Allocated memory is still 107.0MB. Free memory was 69.9MB in the beginning and 67.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:59:52,922 INFO L158 Benchmark]: RCFGBuilder took 569.09ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 67.5MB in the beginning and 104.2MB in the end (delta: -36.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2022-02-20 23:59:52,922 INFO L158 Benchmark]: TraceAbstraction took 5686.12ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 103.7MB in the beginning and 83.7MB in the end (delta: 19.9MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2022-02-20 23:59:52,923 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 107.0MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.06ms. Allocated memory is still 107.0MB. Free memory was 66.5MB in the beginning and 72.5MB in the end (delta: -6.1MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.81ms. Allocated memory is still 107.0MB. Free memory was 72.5MB in the beginning and 69.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.93ms. Allocated memory is still 107.0MB. Free memory was 69.9MB in the beginning and 67.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 569.09ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 67.5MB in the beginning and 104.2MB in the end (delta: -36.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5686.12ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 103.7MB in the beginning and 83.7MB in the end (delta: 19.9MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 94651 column 46: unknown constant v_#valid_BEFORE_CALL_6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 94651 column 46: unknown constant v_#valid_BEFORE_CALL_6: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:59:52,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:59:54,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:59:54,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:59:54,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:59:54,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:59:54,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:59:54,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:59:54,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:59:54,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:59:54,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:59:54,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:59:54,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:59:54,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:59:54,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:59:54,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:59:54,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:59:54,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:59:54,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:59:54,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:59:54,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:59:54,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:59:54,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:59:54,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:59:54,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:59:54,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:59:54,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:59:54,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:59:54,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:59:54,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:59:54,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:59:54,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:59:54,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:59:54,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:59:54,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:59:54,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:59:54,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:59:54,654 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:59:54,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:59:54,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:59:54,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:59:54,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:59:54,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:59:54,673 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:59:54,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:59:54,674 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:59:54,674 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:59:54,675 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:59:54,675 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:59:54,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:59:54,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:59:54,676 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:59:54,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:59:54,677 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:59:54,677 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:59:54,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:59:54,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:59:54,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:59:54,678 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:59:54,678 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:59:54,678 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:59:54,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:59:54,679 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:59:54,679 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:59:54,679 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:59:54,679 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:59:54,679 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:59:54,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:59:54,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:59:54,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:59:54,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:59:54,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:59:54,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:59:54,690 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:59:54,690 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:59:54,690 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:59:54,690 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2022-02-20 23:59:54,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:59:54,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:59:54,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:59:54,990 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:59:54,991 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:59:54,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-02-20 23:59:55,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dbdc5ddc/f2f5a16bbd1e4cbcb9e290ca0f9c004c/FLAGe74513275 [2022-02-20 23:59:55,469 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:59:55,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-02-20 23:59:55,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dbdc5ddc/f2f5a16bbd1e4cbcb9e290ca0f9c004c/FLAGe74513275 [2022-02-20 23:59:55,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dbdc5ddc/f2f5a16bbd1e4cbcb9e290ca0f9c004c [2022-02-20 23:59:55,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:59:55,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:59:55,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:59:55,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:59:55,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:59:55,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:55" (1/1) ... [2022-02-20 23:59:55,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4779af6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:55, skipping insertion in model container [2022-02-20 23:59:55,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:55" (1/1) ... [2022-02-20 23:59:55,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:59:55,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:59:56,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-02-20 23:59:56,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:59:56,118 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:59:56,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-02-20 23:59:56,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:59:56,170 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:59:56,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:56 WrapperNode [2022-02-20 23:59:56,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:59:56,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:59:56,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:59:56,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:59:56,178 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:59:56" (1/1) ... [2022-02-20 23:59:56,196 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:59:56" (1/1) ... [2022-02-20 23:59:56,221 INFO L137 Inliner]: procedures = 131, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2022-02-20 23:59:56,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:59:56,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:59:56,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:59:56,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:59:56,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:56" (1/1) ... [2022-02-20 23:59:56,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:56" (1/1) ... [2022-02-20 23:59:56,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:56" (1/1) ... [2022-02-20 23:59:56,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:56" (1/1) ... [2022-02-20 23:59:56,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:56" (1/1) ... [2022-02-20 23:59:56,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:56" (1/1) ... [2022-02-20 23:59:56,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:56" (1/1) ... [2022-02-20 23:59:56,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:59:56,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:59:56,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:59:56,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:59:56,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:56" (1/1) ... [2022-02-20 23:59:56,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:59:56,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:56,312 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:59:56,315 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:59:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:59:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 23:59:56,341 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 23:59:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:59:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:59:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:59:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:59:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:59:56,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:59:56,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:59:56,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:59:56,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:59:56,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:59:56,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:59:56,466 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:59:56,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:59:56,922 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:59:56,927 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:59:56,928 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:59:56,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:56 BoogieIcfgContainer [2022-02-20 23:59:56,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:59:56,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:59:56,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:59:56,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:59:56,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:59:55" (1/3) ... [2022-02-20 23:59:56,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27047a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:56, skipping insertion in model container [2022-02-20 23:59:56,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:56" (2/3) ... [2022-02-20 23:59:56,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27047a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:56, skipping insertion in model container [2022-02-20 23:59:56,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:56" (3/3) ... [2022-02-20 23:59:56,936 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2022-02-20 23:59:56,940 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:59:56,941 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-02-20 23:59:56,975 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:59:56,980 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:59:56,980 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-02-20 23:59:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 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:59:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:59:56,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:57,000 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:57,000 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:57,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:57,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1814951417, now seen corresponding path program 1 times [2022-02-20 23:59:57,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:57,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561557652] [2022-02-20 23:59:57,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:57,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:57,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:57,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:59:57,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:59:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:57,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:59:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:57,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:57,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:57,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {102#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {102#true} is VALID [2022-02-20 23:59:57,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {102#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {102#true} is VALID [2022-02-20 23:59:57,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {102#true} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {102#true} is VALID [2022-02-20 23:59:57,262 INFO L272 TraceCheckUtils]: 3: Hoare triple {102#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {102#true} is VALID [2022-02-20 23:59:57,264 INFO L290 TraceCheckUtils]: 4: Hoare triple {102#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {119#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:57,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {119#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:57,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {119#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[~temp~0#1.base]); {103#false} is VALID [2022-02-20 23:59:57,265 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:59:57,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:57,266 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:57,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561557652] [2022-02-20 23:59:57,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561557652] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:57,267 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:57,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:59:57,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607932252] [2022-02-20 23:59:57,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:57,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:59:57,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:57,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:57,307 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:59:57,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:57,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:57,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:57,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:57,341 INFO L87 Difference]: Start difference. First operand has 99 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 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 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:57,775 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-02-20 23:59:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:57,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:59:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-02-20 23:59:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-02-20 23:59:57,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-02-20 23:59:57,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:57,910 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:59:57,910 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 23:59:57,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:59:57,914 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:57,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 158 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:57,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 23:59:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-02-20 23:59:57,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:57,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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:59:57,951 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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:59:57,952 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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:59:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:57,957 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-02-20 23:59:57,957 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:59:57,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:57,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:57,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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 94 states. [2022-02-20 23:59:57,958 INFO L87 Difference]: Start difference. First operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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 94 states. [2022-02-20 23:59:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:57,962 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-02-20 23:59:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:59:57,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:57,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:57,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:57,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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:59:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-02-20 23:59:57,969 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 7 [2022-02-20 23:59:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:57,969 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-02-20 23:59:57,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:59:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:59:57,970 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:57,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:57,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:59:58,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:58,183 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:58,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1814951418, now seen corresponding path program 1 times [2022-02-20 23:59:58,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:58,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362050160] [2022-02-20 23:59:58,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:58,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:58,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:58,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:59:58,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:59:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:58,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:59:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:58,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:58,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:58,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {504#true} is VALID [2022-02-20 23:59:58,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {504#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {504#true} is VALID [2022-02-20 23:59:58,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {504#true} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {504#true} is VALID [2022-02-20 23:59:58,310 INFO L272 TraceCheckUtils]: 3: Hoare triple {504#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {504#true} is VALID [2022-02-20 23:59:58,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {504#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {521#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:58,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {521#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {521#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:58,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {521#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~temp~0#1.offset)), #length[~temp~0#1.base]) && ~bvule32(~bvadd32(4bv32, ~temp~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~temp~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~temp~0#1.offset))); {505#false} is VALID [2022-02-20 23:59:58,313 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:59:58,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:58,313 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:58,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362050160] [2022-02-20 23:59:58,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362050160] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:58,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:58,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:59:58,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684976052] [2022-02-20 23:59:58,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:58,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:59:58,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:58,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:58,323 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:59:58,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:58,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:58,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:58,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:58,324 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:58,735 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-02-20 23:59:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:58,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:59:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-20 23:59:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-20 23:59:58,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2022-02-20 23:59:58,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:58,876 INFO L225 Difference]: With dead ends: 92 [2022-02-20 23:59:58,876 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 23:59:58,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:59:58,877 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:58,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 158 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 23:59:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-20 23:59:58,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:58,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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:59:58,882 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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:59:58,882 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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:59:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:58,885 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-02-20 23:59:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-02-20 23:59:58,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:58,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:58,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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 92 states. [2022-02-20 23:59:58,886 INFO L87 Difference]: Start difference. First operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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 92 states. [2022-02-20 23:59:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:58,895 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-02-20 23:59:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-02-20 23:59:58,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:58,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:58,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:58,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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:59:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-02-20 23:59:58,903 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 7 [2022-02-20 23:59:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:58,904 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-02-20 23:59:58,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-02-20 23:59:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:59:58,905 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:58,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:58,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:59,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:59,113 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:59,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1506390976, now seen corresponding path program 1 times [2022-02-20 23:59:59,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:59,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401875651] [2022-02-20 23:59:59,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:59,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:59,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:59,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:59:59,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:59:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:59,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:59:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:59,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:59,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:59,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {895#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {895#true} is VALID [2022-02-20 23:59:59,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {895#true} is VALID [2022-02-20 23:59:59,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {895#true} is VALID [2022-02-20 23:59:59,283 INFO L272 TraceCheckUtils]: 3: Hoare triple {895#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {895#true} is VALID [2022-02-20 23:59:59,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {895#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {912#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:59,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {912#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:59,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {912#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:59,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {912#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:59,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {925#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:59,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {925#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {925#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:59,287 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {925#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {895#true} #185#return; {932#(= (select |#valid| |ULTIMATE.start_sll_create_#t~ret5#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:59,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {932#(= (select |#valid| |ULTIMATE.start_sll_create_#t~ret5#1.base|) (_ bv1 1))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {936#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:59,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {936#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[sll_create_~new_head~0#1.base]); {896#false} is VALID [2022-02-20 23:59:59,289 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:59:59,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:59,289 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:59,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401875651] [2022-02-20 23:59:59,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401875651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:59,290 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:59,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:59:59,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954176959] [2022-02-20 23:59:59,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:59,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 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 13 [2022-02-20 23:59:59,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:59,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:59,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:59,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:59:59,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:59:59,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:59,306 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 00:00:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:00,364 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-02-21 00:00:00,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:00:00,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 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 13 [2022-02-21 00:00:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 00:00:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-02-21 00:00:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 00:00:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-02-21 00:00:00,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 109 transitions. [2022-02-21 00:00:00,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:00,484 INFO L225 Difference]: With dead ends: 96 [2022-02-21 00:00:00,484 INFO L226 Difference]: Without dead ends: 96 [2022-02-21 00:00:00,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 00:00:00,485 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:00,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 329 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 00:00:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-21 00:00:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-02-21 00:00:00,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:00,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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-21 00:00:00,490 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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-21 00:00:00,491 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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-21 00:00:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:00,493 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-02-21 00:00:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-02-21 00:00:00,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:00,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:00,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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 96 states. [2022-02-21 00:00:00,494 INFO L87 Difference]: Start difference. First operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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 96 states. [2022-02-21 00:00:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:00,499 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-02-21 00:00:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-02-21 00:00:00,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:00,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:00,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:00,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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-21 00:00:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-02-21 00:00:00,505 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 13 [2022-02-21 00:00:00,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:00,506 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-02-21 00:00:00,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 00:00:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-02-21 00:00:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 00:00:00,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:00,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:00,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:00,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:00:00,713 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-21 00:00:00,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:00,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1506390975, now seen corresponding path program 1 times [2022-02-21 00:00:00,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:00:00,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211520077] [2022-02-21 00:00:00,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:00,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:00:00,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:00:00,715 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 00:00:00,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-21 00:00:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:00,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 00:00:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:00,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:00,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 00:00:00,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {1320#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {1320#true} is VALID [2022-02-21 00:00:00,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {1320#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {1320#true} is VALID [2022-02-21 00:00:00,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {1320#true} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {1320#true} is VALID [2022-02-21 00:00:00,943 INFO L272 TraceCheckUtils]: 3: Hoare triple {1320#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {1320#true} is VALID [2022-02-21 00:00:00,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {1320#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1337#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:00,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {1337#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1337#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:00,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {1337#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {1337#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:00,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {1337#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {1337#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:00,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {1337#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1350#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)))} is VALID [2022-02-21 00:00:00,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {1350#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)))} assume true; {1350#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)))} is VALID [2022-02-21 00:00:00,947 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1350#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)))} {1320#true} #185#return; {1357#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= |ULTIMATE.start_sll_create_#t~ret5#1.offset| (_ bv0 32)))} is VALID [2022-02-21 00:00:00,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {1357#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= |ULTIMATE.start_sll_create_#t~ret5#1.offset| (_ bv0 32)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {1361#(and (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} is VALID [2022-02-21 00:00:00,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {1361#(and (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset)), #length[sll_create_~new_head~0#1.base]) && ~bvule32(~bvadd32(4bv32, sll_create_~new_head~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset))); {1321#false} is VALID [2022-02-21 00:00:00,948 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-21 00:00:00,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:00:00,949 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:00:00,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211520077] [2022-02-21 00:00:00,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211520077] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:00,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:00,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 00:00:00,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536905723] [2022-02-21 00:00:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:00,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 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 13 [2022-02-21 00:00:00,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:00,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 00:00:00,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:00,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 00:00:00,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:00:00,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 00:00:00,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 00:00:00,966 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 00:00:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:02,285 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-02-21 00:00:02,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:00:02,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 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 13 [2022-02-21 00:00:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 00:00:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-02-21 00:00:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 00:00:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-02-21 00:00:02,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 108 transitions. [2022-02-21 00:00:02,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:02,418 INFO L225 Difference]: With dead ends: 95 [2022-02-21 00:00:02,419 INFO L226 Difference]: Without dead ends: 95 [2022-02-21 00:00:02,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 00:00:02,420 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 9 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:02,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 345 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-21 00:00:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-21 00:00:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2022-02-21 00:00:02,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:02,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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-21 00:00:02,425 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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-21 00:00:02,425 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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-21 00:00:02,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:02,428 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-02-21 00:00:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-02-21 00:00:02,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:02,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:02,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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 95 states. [2022-02-21 00:00:02,429 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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 95 states. [2022-02-21 00:00:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:02,432 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-02-21 00:00:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-02-21 00:00:02,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:02,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:02,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:02,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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-21 00:00:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-02-21 00:00:02,435 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 13 [2022-02-21 00:00:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:02,435 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-02-21 00:00:02,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 00:00:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-02-21 00:00:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 00:00:02,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:02,436 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:02,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-21 00:00:02,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:00:02,642 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-21 00:00:02,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:02,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2068593344, now seen corresponding path program 1 times [2022-02-21 00:00:02,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:00:02,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250794484] [2022-02-21 00:00:02,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:02,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:00:02,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:00:02,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 00:00:02,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-21 00:00:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:02,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 00:00:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:02,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:02,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {1741#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {1741#true} is VALID [2022-02-21 00:00:02,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {1741#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {1749#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-21 00:00:02,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {1749#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {1742#false} is VALID [2022-02-21 00:00:02,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {1742#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1742#false} is VALID [2022-02-21 00:00:02,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {1742#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {1742#false} is VALID [2022-02-21 00:00:02,760 INFO L272 TraceCheckUtils]: 5: Hoare triple {1742#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {1742#false} is VALID [2022-02-21 00:00:02,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {1742#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1742#false} is VALID [2022-02-21 00:00:02,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {1742#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1742#false} is VALID [2022-02-21 00:00:02,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {1742#false} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {1742#false} is VALID [2022-02-21 00:00:02,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {1742#false} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {1742#false} is VALID [2022-02-21 00:00:02,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {1742#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1742#false} is VALID [2022-02-21 00:00:02,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {1742#false} assume true; {1742#false} is VALID [2022-02-21 00:00:02,763 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1742#false} {1742#false} #187#return; {1742#false} is VALID [2022-02-21 00:00:02,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {1742#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {1742#false} is VALID [2022-02-21 00:00:02,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {1742#false} assume !(1bv1 == #valid[sll_insert_~head#1.base]); {1742#false} is VALID [2022-02-21 00:00:02,763 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-21 00:00:02,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:00:02,764 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:00:02,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250794484] [2022-02-21 00:00:02,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250794484] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:02,765 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:02,765 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:00:02,765 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340337981] [2022-02-21 00:00:02,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:02,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-21 00:00:02,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:02,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-21 00:00:02,790 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-21 00:00:02,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:00:02,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:00:02,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:00:02,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:00:02,791 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-21 00:00:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:03,074 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-21 00:00:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:00:03,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-21 00:00:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-21 00:00:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-02-21 00:00:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-21 00:00:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-02-21 00:00:03,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 107 transitions. [2022-02-21 00:00:03,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:03,204 INFO L225 Difference]: With dead ends: 96 [2022-02-21 00:00:03,204 INFO L226 Difference]: Without dead ends: 96 [2022-02-21 00:00:03,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-21 00:00:03,205 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:03,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 193 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:00:03,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-21 00:00:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-02-21 00:00:03,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:03,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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-21 00:00:03,209 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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-21 00:00:03,209 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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-21 00:00:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:03,211 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-21 00:00:03,211 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-21 00:00:03,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:03,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:03,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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 96 states. [2022-02-21 00:00:03,212 INFO L87 Difference]: Start difference. First operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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 96 states. [2022-02-21 00:00:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:03,215 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-21 00:00:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-21 00:00:03,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:03,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:03,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:03,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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-21 00:00:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-02-21 00:00:03,218 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 15 [2022-02-21 00:00:03,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:03,218 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-02-21 00:00:03,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-21 00:00:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-02-21 00:00:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 00:00:03,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:03,219 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:03,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:03,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:00:03,427 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-21 00:00:03,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:03,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1769802942, now seen corresponding path program 1 times [2022-02-21 00:00:03,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:00:03,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355063965] [2022-02-21 00:00:03,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:03,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:00:03,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:00:03,430 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 00:00:03,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-21 00:00:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:03,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 00:00:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:03,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:03,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {2167#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2167#true} is VALID [2022-02-21 00:00:03,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {2167#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-21 00:00:03,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-21 00:00:03,622 INFO L272 TraceCheckUtils]: 3: Hoare triple {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2167#true} is VALID [2022-02-21 00:00:03,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {2167#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2167#true} is VALID [2022-02-21 00:00:03,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {2167#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2167#true} is VALID [2022-02-21 00:00:03,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {2167#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2167#true} is VALID [2022-02-21 00:00:03,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {2167#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {2167#true} is VALID [2022-02-21 00:00:03,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {2167#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2167#true} is VALID [2022-02-21 00:00:03,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-02-21 00:00:03,623 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2167#true} {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} #185#return; {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-21 00:00:03,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-21 00:00:03,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L588 {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-21 00:00:03,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-21 00:00:03,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {2175#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2215#(= (bvadd |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) (_ bv2 32))} is VALID [2022-02-21 00:00:03,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {2215#(= (bvadd |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) (_ bv2 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {2168#false} is VALID [2022-02-21 00:00:03,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {2168#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2168#false} is VALID [2022-02-21 00:00:03,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {2168#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {2168#false} is VALID [2022-02-21 00:00:03,626 INFO L272 TraceCheckUtils]: 18: Hoare triple {2168#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {2168#false} is VALID [2022-02-21 00:00:03,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {2168#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2168#false} is VALID [2022-02-21 00:00:03,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {2168#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2168#false} is VALID [2022-02-21 00:00:03,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {2168#false} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2168#false} is VALID [2022-02-21 00:00:03,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {2168#false} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {2168#false} is VALID [2022-02-21 00:00:03,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {2168#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2168#false} is VALID [2022-02-21 00:00:03,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {2168#false} assume true; {2168#false} is VALID [2022-02-21 00:00:03,627 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2168#false} {2168#false} #187#return; {2168#false} is VALID [2022-02-21 00:00:03,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {2168#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {2168#false} is VALID [2022-02-21 00:00:03,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {2168#false} assume !(1bv1 == #valid[sll_insert_~head#1.base]); {2168#false} is VALID [2022-02-21 00:00:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:03,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:03,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {2168#false} assume !(1bv1 == #valid[sll_insert_~head#1.base]); {2168#false} is VALID [2022-02-21 00:00:03,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {2168#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {2168#false} is VALID [2022-02-21 00:00:03,746 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2167#true} {2168#false} #187#return; {2168#false} is VALID [2022-02-21 00:00:03,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-02-21 00:00:03,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {2167#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2167#true} is VALID [2022-02-21 00:00:03,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {2167#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {2167#true} is VALID [2022-02-21 00:00:03,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {2167#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2167#true} is VALID [2022-02-21 00:00:03,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {2167#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2167#true} is VALID [2022-02-21 00:00:03,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {2167#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2167#true} is VALID [2022-02-21 00:00:03,747 INFO L272 TraceCheckUtils]: 18: Hoare triple {2168#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {2167#true} is VALID [2022-02-21 00:00:03,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {2168#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {2168#false} is VALID [2022-02-21 00:00:03,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {2168#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2168#false} is VALID [2022-02-21 00:00:03,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {2291#(bvsgt |ULTIMATE.start_sll_create_~len#1| (_ bv0 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {2168#false} is VALID [2022-02-21 00:00:03,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2291#(bvsgt |ULTIMATE.start_sll_create_~len#1| (_ bv0 32))} is VALID [2022-02-21 00:00:03,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-21 00:00:03,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L588 {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-21 00:00:03,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-21 00:00:03,751 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2167#true} {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} #185#return; {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-21 00:00:03,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-02-21 00:00:03,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {2167#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2167#true} is VALID [2022-02-21 00:00:03,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {2167#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {2167#true} is VALID [2022-02-21 00:00:03,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {2167#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2167#true} is VALID [2022-02-21 00:00:03,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {2167#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2167#true} is VALID [2022-02-21 00:00:03,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {2167#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2167#true} is VALID [2022-02-21 00:00:03,752 INFO L272 TraceCheckUtils]: 3: Hoare triple {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2167#true} is VALID [2022-02-21 00:00:03,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-21 00:00:03,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {2167#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {2295#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-21 00:00:03,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {2167#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2167#true} is VALID [2022-02-21 00:00:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 00:00:03,754 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:00:03,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355063965] [2022-02-21 00:00:03,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355063965] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:00:03,755 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 00:00:03,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-02-21 00:00:03,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320452333] [2022-02-21 00:00:03,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 00:00:03,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-21 00:00:03,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:03,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 00:00:03,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:03,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 00:00:03,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:00:03,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 00:00:03,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-21 00:00:03,815 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 00:00:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:04,301 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-02-21 00:00:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 00:00:04,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-21 00:00:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 00:00:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2022-02-21 00:00:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 00:00:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2022-02-21 00:00:04,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 114 transitions. [2022-02-21 00:00:04,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:04,420 INFO L225 Difference]: With dead ends: 102 [2022-02-21 00:00:04,420 INFO L226 Difference]: Without dead ends: 102 [2022-02-21 00:00:04,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-21 00:00:04,421 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 15 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:04,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 293 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:00:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-21 00:00:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-02-21 00:00:04,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:04,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:04,425 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:04,425 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:04,427 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-02-21 00:00:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-02-21 00:00:04,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:04,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:04,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-02-21 00:00:04,431 INFO L87 Difference]: Start difference. First operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-02-21 00:00:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:04,433 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-02-21 00:00:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-02-21 00:00:04,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:04,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:04,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:04,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-02-21 00:00:04,436 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 28 [2022-02-21 00:00:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:04,436 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-02-21 00:00:04,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 00:00:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-02-21 00:00:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-21 00:00:04,437 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:04,437 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:04,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:04,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:00:04,644 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-21 00:00:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:04,645 INFO L85 PathProgramCache]: Analyzing trace with hash -888530816, now seen corresponding path program 2 times [2022-02-21 00:00:04,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:00:04,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998603300] [2022-02-21 00:00:04,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:00:04,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:00:04,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:00:04,646 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 00:00:04,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-21 00:00:04,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 00:00:04,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:00:04,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 00:00:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:04,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:04,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 00:00:04,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-21 00:00:05,162 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-21 00:00:05,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-21 00:00:05,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-21 00:00:05,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:05,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:00:05,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-21 00:00:07,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:07,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:00:07,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {2740#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2740#true} is VALID [2022-02-21 00:00:07,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:07,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:07,899 INFO L272 TraceCheckUtils]: 3: Hoare triple {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2755#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,900 INFO L290 TraceCheckUtils]: 4: Hoare triple {2755#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2759#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {2759#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2759#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {2759#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2759#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {2759#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {2759#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {2759#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2759#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {2759#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {2759#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,920 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2759#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} #185#return; {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:07,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:07,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L588 {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:07,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:07,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:07,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:07,924 INFO L272 TraceCheckUtils]: 16: Hoare triple {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2755#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {2755#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2799#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {2799#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2799#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {2799#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2799#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {2799#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {2799#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {2799#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2799#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {2799#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {2799#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,937 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2799#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {2748#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} #185#return; {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} is VALID [2022-02-21 00:00:07,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} is VALID [2022-02-21 00:00:07,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L588 {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} is VALID [2022-02-21 00:00:07,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} is VALID [2022-02-21 00:00:07,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} is VALID [2022-02-21 00:00:07,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} is VALID [2022-02-21 00:00:07,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} is VALID [2022-02-21 00:00:07,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {2818#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {2840#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1)))} is VALID [2022-02-21 00:00:07,941 INFO L272 TraceCheckUtils]: 31: Hoare triple {2840#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1)))} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {2844#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:07,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {2844#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2848#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))} is VALID [2022-02-21 00:00:07,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {2848#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2848#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))} is VALID [2022-02-21 00:00:07,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {2848#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2848#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))} is VALID [2022-02-21 00:00:07,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {2848#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {2848#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))} is VALID [2022-02-21 00:00:07,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {2848#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2848#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))} is VALID [2022-02-21 00:00:07,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {2848#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))} assume true; {2848#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))} is VALID [2022-02-21 00:00:07,954 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2848#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))} {2840#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1)))} #187#return; {2867#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |node_create_~temp~0#1.base|)))) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1)))} is VALID [2022-02-21 00:00:07,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {2867#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |node_create_~temp~0#1.base|)))) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1)))} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {2867#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |node_create_~temp~0#1.base|)))) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1)))} is VALID [2022-02-21 00:00:07,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {2867#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |node_create_~temp~0#1.base|)))) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[sll_insert_~head#1.base]); {2741#false} is VALID [2022-02-21 00:00:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 6 refuted. 6 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 00:00:07,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:08,056 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:00:08,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998603300] [2022-02-21 00:00:08,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998603300] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:08,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1501715676] [2022-02-21 00:00:08,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:00:08,057 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-21 00:00:08,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-21 00:00:08,059 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-21 00:00:08,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-02-21 00:00:08,251 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 00:00:08,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304422014] [2022-02-21 00:00:08,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:00:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:00:08,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 1 [2022-02-21 00:00:08,254 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:00:08,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 00:00:08,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 00:00:08,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:00:08,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 00:00:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:08,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:08,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 00:00:10,701 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-21 00:00:10,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-21 00:00:14,957 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-21 00:00:14,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-21 00:00:15,110 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-21 00:00:15,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-21 00:00:15,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {2740#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2740#true} is VALID [2022-02-21 00:00:15,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,134 INFO L272 TraceCheckUtils]: 3: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2895#(= |old(#valid)| |#valid|)} is VALID [2022-02-21 00:00:15,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {2895#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2899#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_271 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_271) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-21 00:00:15,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {2899#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_271 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_271) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2899#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_271 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_271) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-21 00:00:15,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {2899#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_271 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_271) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2899#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_271 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_271) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-21 00:00:15,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {2899#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_271 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_271) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {2899#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_271 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_271) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-21 00:00:15,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {2899#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_271 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_271) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2899#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_271 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_271) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-21 00:00:15,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {2899#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_271 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_271) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume true; {2899#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_271 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_271) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-21 00:00:15,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2899#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_271 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_271) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} #185#return; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L588 {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,145 INFO L272 TraceCheckUtils]: 16: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2895#(= |old(#valid)| |#valid|)} is VALID [2022-02-21 00:00:15,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {2895#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2939#(exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))} is VALID [2022-02-21 00:00:15,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {2939#(exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2939#(exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))} is VALID [2022-02-21 00:00:15,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {2939#(exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} is VALID [2022-02-21 00:00:15,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} is VALID [2022-02-21 00:00:15,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} is VALID [2022-02-21 00:00:15,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} assume true; {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} is VALID [2022-02-21 00:00:15,151 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} #185#return; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L588 {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:15,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} is VALID [2022-02-21 00:00:15,155 INFO L272 TraceCheckUtils]: 31: Hoare triple {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {2895#(= |old(#valid)| |#valid|)} is VALID [2022-02-21 00:00:15,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {2895#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2939#(exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))} is VALID [2022-02-21 00:00:15,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {2939#(exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2939#(exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))} is VALID [2022-02-21 00:00:15,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {2939#(exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} is VALID [2022-02-21 00:00:15,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} is VALID [2022-02-21 00:00:15,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} is VALID [2022-02-21 00:00:15,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} assume true; {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} is VALID [2022-02-21 00:00:15,163 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2946#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (exists ((v_ArrVal_272 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_272) |#valid|))))} {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} #187#return; {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} is VALID [2022-02-21 00:00:15,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} is VALID [2022-02-21 00:00:15,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[sll_insert_~head#1.base]); {2741#false} is VALID [2022-02-21 00:00:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 8 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 00:00:15,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:20,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[sll_insert_~head#1.base]); {2741#false} is VALID [2022-02-21 00:00:20,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} is VALID [2022-02-21 00:00:20,021 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} #187#return; {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} is VALID [2022-02-21 00:00:20,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} assume true; {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {3032#(or (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|))))) (not (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {3032#(or (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|))))) (not (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3032#(or (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|))))) (not (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))))} is VALID [2022-02-21 00:00:20,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3032#(or (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|))))) (not (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))))} is VALID [2022-02-21 00:00:20,029 INFO L272 TraceCheckUtils]: 31: Hoare triple {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {2874#(= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv1 1))} is VALID [2022-02-21 00:00:20,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L588 {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,034 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} #185#return; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} assume true; {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {3032#(or (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|))))) (not (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {3032#(or (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|))))) (not (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3032#(or (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|))))) (not (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))))} is VALID [2022-02-21 00:00:20,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3032#(or (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|))))) (not (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))))} is VALID [2022-02-21 00:00:20,038 INFO L272 TraceCheckUtils]: 16: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L588 {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,041 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} #185#return; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} assume true; {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,045 INFO L272 TraceCheckUtils]: 3: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {3019#(forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|) (_ bv1 1)) (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_3|)))))} is VALID [2022-02-21 00:00:20,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {2888#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:20,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {2740#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2740#true} is VALID [2022-02-21 00:00:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-21 00:00:20,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304422014] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:00:20,048 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:00:20,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 5] total 18 [2022-02-21 00:00:20,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774865870] [2022-02-21 00:00:20,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:00:20,049 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 41 [2022-02-21 00:00:20,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:20,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 00:00:20,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:20,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-21 00:00:20,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:00:20,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 00:00:20,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=305, Unknown=4, NotChecked=0, Total=380 [2022-02-21 00:00:20,228 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 00:00:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:36,806 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2022-02-21 00:00:36,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 00:00:36,806 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 41 [2022-02-21 00:00:36,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 00:00:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 180 transitions. [2022-02-21 00:00:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 00:00:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 180 transitions. [2022-02-21 00:00:36,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 180 transitions. [2022-02-21 00:00:37,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:37,024 INFO L225 Difference]: With dead ends: 166 [2022-02-21 00:00:37,024 INFO L226 Difference]: Without dead ends: 166 [2022-02-21 00:00:37,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 94 SyntacticMatches, 13 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=124, Invalid=520, Unknown=6, NotChecked=0, Total=650 [2022-02-21 00:00:37,025 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 112 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:37,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 777 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 329 Invalid, 0 Unknown, 163 Unchecked, 0.5s Time] [2022-02-21 00:00:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-02-21 00:00:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 102. [2022-02-21 00:00:37,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:37,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 102 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:37,030 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 102 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:37,030 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 102 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:37,033 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2022-02-21 00:00:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2022-02-21 00:00:37,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:37,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:37,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 166 states. [2022-02-21 00:00:37,034 INFO L87 Difference]: Start difference. First operand has 102 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 166 states. [2022-02-21 00:00:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:37,039 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2022-02-21 00:00:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2022-02-21 00:00:37,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:37,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:37,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:37,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-02-21 00:00:37,042 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 41 [2022-02-21 00:00:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:37,042 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-02-21 00:00:37,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 00:00:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-02-21 00:00:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-21 00:00:37,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:37,045 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:37,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:37,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-21 00:00:37,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:37,458 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-21 00:00:37,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:37,458 INFO L85 PathProgramCache]: Analyzing trace with hash -888530815, now seen corresponding path program 1 times [2022-02-21 00:00:37,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:00:37,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628860933] [2022-02-21 00:00:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:37,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:00:37,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:00:37,460 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 00:00:37,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-21 00:00:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:37,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-21 00:00:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:37,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:37,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 00:00:37,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 00:00:37,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-21 00:00:37,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-21 00:00:39,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:39,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:00:39,880 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 00:00:39,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 00:00:39,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-21 00:00:42,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:42,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:00:42,521 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-21 00:00:42,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-21 00:00:42,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {3745#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {3745#true} is VALID [2022-02-21 00:00:42,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {3745#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {3753#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {3753#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {3753#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,621 INFO L272 TraceCheckUtils]: 3: Hoare triple {3753#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {3760#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {3760#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3764#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_341)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {3764#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_341)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3764#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_341)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {3764#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_341)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3764#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_341)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {3764#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_341)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {3764#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_341)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {3764#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_341)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3764#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_341)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {3764#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_341)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {3764#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_341)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,637 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3764#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_341)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {3753#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} #185#return; {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L588 {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,643 INFO L272 TraceCheckUtils]: 16: Hoare triple {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {3802#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {3802#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:42,660 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} #185#return; {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L588 {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:42,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {3825#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {3847#(and (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32)) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-21 00:00:42,666 INFO L272 TraceCheckUtils]: 31: Hoare triple {3847#(and (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32)) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {3851#(= |#length| |old(#length)|)} is VALID [2022-02-21 00:00:42,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {3851#(= |#length| |old(#length)|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3855#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} is VALID [2022-02-21 00:00:42,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {3855#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3855#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} is VALID [2022-02-21 00:00:42,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {3855#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3855#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} is VALID [2022-02-21 00:00:42,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {3855#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {3855#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} is VALID [2022-02-21 00:00:42,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {3855#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3855#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} is VALID [2022-02-21 00:00:42,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {3855#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} assume true; {3855#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} is VALID [2022-02-21 00:00:42,671 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3855#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} {3847#(and (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32)) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} #187#return; {3874#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_sll_insert_~head#1.base| |node_create_~temp~0#1.base|) (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-21 00:00:42,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {3874#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_sll_insert_~head#1.base| |node_create_~temp~0#1.base|) (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {3874#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_sll_insert_~head#1.base| |node_create_~temp~0#1.base|) (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-21 00:00:42,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {3874#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_sll_insert_~head#1.base| |node_create_~temp~0#1.base|) (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} assume !((~bvule32(~bvadd32(4bv32, sll_insert_~head#1.offset), #length[sll_insert_~head#1.base]) && ~bvule32(sll_insert_~head#1.offset, ~bvadd32(4bv32, sll_insert_~head#1.offset))) && ~bvule32(0bv32, sll_insert_~head#1.offset)); {3746#false} is VALID [2022-02-21 00:00:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:42,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:42,886 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:00:42,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628860933] [2022-02-21 00:00:42,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628860933] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:42,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1399730188] [2022-02-21 00:00:42,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:42,886 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-21 00:00:42,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-21 00:00:42,887 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-21 00:00:42,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-02-21 00:00:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:43,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 00:00:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:43,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:43,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 00:00:43,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-21 00:00:43,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:43,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:00:43,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-21 00:00:45,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:45,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:00:46,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-21 00:00:46,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:46,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:00:46,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {3745#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {3745#true} is VALID [2022-02-21 00:00:46,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {3745#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1, main_#t~post21#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,263 INFO L272 TraceCheckUtils]: 3: Hoare triple {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {3802#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,264 INFO L290 TraceCheckUtils]: 4: Hoare triple {3802#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {3783#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} #185#return; {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L588 {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,280 INFO L272 TraceCheckUtils]: 16: Hoare triple {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {3941#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {3941#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3945#(and (exists ((v_ArrVal_403 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_403))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:46,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {3945#(and (exists ((v_ArrVal_403 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_403))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3945#(and (exists ((v_ArrVal_403 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_403))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:46,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {3945#(and (exists ((v_ArrVal_403 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_403))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3945#(and (exists ((v_ArrVal_403 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_403))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:46,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {3945#(and (exists ((v_ArrVal_403 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_403))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {3945#(and (exists ((v_ArrVal_403 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_403))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:46,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {3945#(and (exists ((v_ArrVal_403 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_403))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3958#(and (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_403 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_#res#1.base| v_ArrVal_403))))} is VALID [2022-02-21 00:00:46,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {3958#(and (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_403 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_#res#1.base| v_ArrVal_403))))} assume true; {3958#(and (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_403 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_#res#1.base| v_ArrVal_403))))} is VALID [2022-02-21 00:00:46,290 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3958#(and (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_403 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_#res#1.base| v_ArrVal_403))))} {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} #185#return; {3965#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (bvult |ULTIMATE.start_sll_create_#t~ret5#1.base| |#StackHeapBarrier|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {3965#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (bvult |ULTIMATE.start_sll_create_#t~ret5#1.base| |#StackHeapBarrier|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L588 {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:46,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {3922#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {3987#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-21 00:00:46,308 INFO L272 TraceCheckUtils]: 31: Hoare triple {3987#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)))} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {3941#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {3941#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L580 {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:46,330 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3806#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_342)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {3987#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)))} #187#return; {3847#(and (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32)) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-21 00:00:46,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {3847#(and (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32)) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {3847#(and (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32)) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-21 00:00:46,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {3847#(and (= (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (_ bv4 32)) (= |ULTIMATE.start_sll_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} assume !((~bvule32(~bvadd32(4bv32, sll_insert_~head#1.offset), #length[sll_insert_~head#1.base]) && ~bvule32(sll_insert_~head#1.offset, ~bvadd32(4bv32, sll_insert_~head#1.offset))) && ~bvule32(0bv32, sll_insert_~head#1.offset)); {3746#false} is VALID [2022-02-21 00:00:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 00:00:46,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:54,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1399730188] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:54,619 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 00:00:54,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-02-21 00:00:54,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444214291] [2022-02-21 00:00:54,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 00:00:54,620 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-02-21 00:00:54,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:54,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 00:00:54,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:54,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-21 00:00:54,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:00:54,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 00:00:54,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=391, Unknown=7, NotChecked=0, Total=462 [2022-02-21 00:00:54,802 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6)