./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_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/sll2c_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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:58:37,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:58:37,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:58:37,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:58:37,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:58:37,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:58:37,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:58:37,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:58:37,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:58:37,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:58:37,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:58:37,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:58:37,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:58:37,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:58:37,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:58:37,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:58:37,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:58:37,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:58:37,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:58:37,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:58:37,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:58:37,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:58:37,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:58:37,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:58:37,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:58:37,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:58:37,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:58:37,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:58:37,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:58:37,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:58:37,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:58:37,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:58:37,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:58:37,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:58:37,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:58:37,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:58:37,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:58:37,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:58:37,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:58:37,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:58:37,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:58:37,374 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:58:37,387 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:58:37,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:58:37,388 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:58:37,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:58:37,389 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:58:37,389 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:58:37,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:58:37,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:58:37,390 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:58:37,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:58:37,390 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:58:37,390 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:58:37,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:58:37,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:58:37,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:58:37,391 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:58:37,391 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:58:37,391 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:58:37,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:58:37,392 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:58:37,392 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:58:37,392 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:58:37,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:58:37,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:58:37,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:58:37,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:58:37,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:58:37,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:58:37,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:58:37,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:58:37,393 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2022-02-20 23:58:37,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:58:37,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:58:37,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:58:37,588 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:58:37,589 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:58:37,590 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-02-20 23:58:37,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dbad1061/2a2aeab82d98469ab6fa47299b0bbc87/FLAG37b15b2e2 [2022-02-20 23:58:38,029 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:58:38,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-02-20 23:58:38,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dbad1061/2a2aeab82d98469ab6fa47299b0bbc87/FLAG37b15b2e2 [2022-02-20 23:58:38,064 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dbad1061/2a2aeab82d98469ab6fa47299b0bbc87 [2022-02-20 23:58:38,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:58:38,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:58:38,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:58:38,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:58:38,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:58:38,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:58:38" (1/1) ... [2022-02-20 23:58:38,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e202008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:38, skipping insertion in model container [2022-02-20 23:58:38,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:58:38" (1/1) ... [2022-02-20 23:58:38,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:58:38,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:58:38,347 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/sll2c_insert_unequal.i[24872,24885] [2022-02-20 23:58:38,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:58:38,363 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:58:38,413 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/sll2c_insert_unequal.i[24872,24885] [2022-02-20 23:58:38,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:58:38,441 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:58:38,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:38 WrapperNode [2022-02-20 23:58:38,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:58:38,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:58:38,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:58:38,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:58:38,450 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:58:38" (1/1) ... [2022-02-20 23:58:38,463 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:58:38" (1/1) ... [2022-02-20 23:58:38,487 INFO L137 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 178 [2022-02-20 23:58:38,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:58:38,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:58:38,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:58:38,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:58:38,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:38" (1/1) ... [2022-02-20 23:58:38,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:38" (1/1) ... [2022-02-20 23:58:38,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:38" (1/1) ... [2022-02-20 23:58:38,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:38" (1/1) ... [2022-02-20 23:58:38,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:38" (1/1) ... [2022-02-20 23:58:38,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:38" (1/1) ... [2022-02-20 23:58:38,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:38" (1/1) ... [2022-02-20 23:58:38,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:58:38,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:58:38,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:58:38,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:58:38,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:38" (1/1) ... [2022-02-20 23:58:38,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:58:38,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:38,555 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:58:38,560 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:58:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:58:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:58:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 23:58:38,579 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 23:58:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:58:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:58:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:58:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:58:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:58:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:58:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:58:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:58:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:58:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:58:38,653 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:58:38,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:58:39,218 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:58:39,223 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:58:39,223 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:58:39,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:58:39 BoogieIcfgContainer [2022-02-20 23:58:39,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:58:39,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:58:39,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:58:39,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:58:39,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:58:38" (1/3) ... [2022-02-20 23:58:39,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e40686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:58:39, skipping insertion in model container [2022-02-20 23:58:39,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:38" (2/3) ... [2022-02-20 23:58:39,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e40686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:58:39, skipping insertion in model container [2022-02-20 23:58:39,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:58:39" (3/3) ... [2022-02-20 23:58:39,233 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2022-02-20 23:58:39,237 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:58:39,238 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-02-20 23:58:39,267 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:58:39,271 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:58:39,271 INFO L340 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-02-20 23:58:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 74 states have (on average 2.081081081081081) internal successors, (154), 136 states have internal predecessors, (154), 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:58:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:58:39,290 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:39,290 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:58:39,291 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:39,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash 896568277, now seen corresponding path program 1 times [2022-02-20 23:58:39,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:39,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462808953] [2022-02-20 23:58:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:39,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:39,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {144#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); {144#true} is VALID [2022-02-20 23:58:39,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {144#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {144#true} is VALID [2022-02-20 23:58:39,446 INFO L272 TraceCheckUtils]: 2: Hoare triple {144#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {144#true} is VALID [2022-02-20 23:58:39,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {144#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; {146#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:39,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {146#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {146#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:39,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(1 == #valid[~temp~0#1.base]); {145#false} is VALID [2022-02-20 23:58:39,451 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:58:39,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:39,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462808953] [2022-02-20 23:58:39,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462808953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:39,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:39,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:58:39,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204562250] [2022-02-20 23:58:39,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:39,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-02-20 23:58:39,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:39,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:39,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:39,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:39,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:39,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:39,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:39,496 INFO L87 Difference]: Start difference. First operand has 141 states, 74 states have (on average 2.081081081081081) internal successors, (154), 136 states have internal predecessors, (154), 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 has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:39,775 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2022-02-20 23:58:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:39,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-02-20 23:58:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2022-02-20 23:58:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2022-02-20 23:58:39,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2022-02-20 23:58:39,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:39,908 INFO L225 Difference]: With dead ends: 139 [2022-02-20 23:58:39,908 INFO L226 Difference]: Without dead ends: 136 [2022-02-20 23:58:39,909 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:58:39,913 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:39,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 225 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-02-20 23:58:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-02-20 23:58:39,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:39,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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:58:39,940 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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:58:39,941 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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:58:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:39,947 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2022-02-20 23:58:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-02-20 23:58:39,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:39,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:39,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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 136 states. [2022-02-20 23:58:39,949 INFO L87 Difference]: Start difference. First operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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 136 states. [2022-02-20 23:58:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:39,955 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2022-02-20 23:58:39,955 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-02-20 23:58:39,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:39,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:39,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:39,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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:58:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2022-02-20 23:58:39,962 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 6 [2022-02-20 23:58:39,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:39,962 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2022-02-20 23:58:39,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-02-20 23:58:39,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:58:39,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:39,963 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:58:39,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:58:39,963 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:39,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:39,964 INFO L85 PathProgramCache]: Analyzing trace with hash 896568278, now seen corresponding path program 1 times [2022-02-20 23:58:39,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:39,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155902884] [2022-02-20 23:58:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:39,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:40,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {696#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); {696#true} is VALID [2022-02-20 23:58:40,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {696#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {696#true} is VALID [2022-02-20 23:58:40,007 INFO L272 TraceCheckUtils]: 2: Hoare triple {696#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {696#true} is VALID [2022-02-20 23:58:40,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {696#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; {698#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:58:40,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {698#(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); {698#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:58:40,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {698#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} assume !(4 + ~temp~0#1.offset <= #length[~temp~0#1.base] && 0 <= ~temp~0#1.offset); {697#false} is VALID [2022-02-20 23:58:40,013 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:58:40,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:40,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155902884] [2022-02-20 23:58:40,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155902884] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:40,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:40,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:58:40,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858535801] [2022-02-20 23:58:40,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:40,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-02-20 23:58:40,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:40,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:40,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:40,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:40,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:40,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:40,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:40,023 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,218 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2022-02-20 23:58:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:40,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-02-20 23:58:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-02-20 23:58:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-02-20 23:58:40,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 148 transitions. [2022-02-20 23:58:40,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:40,321 INFO L225 Difference]: With dead ends: 134 [2022-02-20 23:58:40,321 INFO L226 Difference]: Without dead ends: 134 [2022-02-20 23:58:40,322 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:58:40,322 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:40,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-20 23:58:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-02-20 23:58:40,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:40,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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:58:40,328 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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:58:40,328 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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:58:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,331 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2022-02-20 23:58:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-02-20 23:58:40,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:40,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:40,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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 134 states. [2022-02-20 23:58:40,333 INFO L87 Difference]: Start difference. First operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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 134 states. [2022-02-20 23:58:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,346 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2022-02-20 23:58:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-02-20 23:58:40,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:40,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:40,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:40,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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:58:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-02-20 23:58:40,351 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 6 [2022-02-20 23:58:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:40,351 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-02-20 23:58:40,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-02-20 23:58:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:58:40,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:40,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:40,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:58:40,368 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash 24922967, now seen corresponding path program 1 times [2022-02-20 23:58:40,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:40,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67952645] [2022-02-20 23:58:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:40,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:58:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:40,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {1247#(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; {1237#true} is VALID [2022-02-20 23:58:40,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {1237#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1237#true} is VALID [2022-02-20 23:58:40,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {1237#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1237#true} is VALID [2022-02-20 23:58:40,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {1237#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1237#true} is VALID [2022-02-20 23:58:40,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {1237#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1237#true} is VALID [2022-02-20 23:58:40,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {1237#true} assume true; {1237#true} is VALID [2022-02-20 23:58:40,470 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1237#true} {1239#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #236#return; {1239#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:58:40,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {1237#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); {1237#true} is VALID [2022-02-20 23:58:40,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {1237#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1239#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:58:40,472 INFO L272 TraceCheckUtils]: 2: Hoare triple {1239#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1247#(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:58:40,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {1247#(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; {1237#true} is VALID [2022-02-20 23:58:40,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {1237#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1237#true} is VALID [2022-02-20 23:58:40,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {1237#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1237#true} is VALID [2022-02-20 23:58:40,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {1237#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1237#true} is VALID [2022-02-20 23:58:40,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {1237#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1237#true} is VALID [2022-02-20 23:58:40,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {1237#true} assume true; {1237#true} is VALID [2022-02-20 23:58:40,474 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1237#true} {1239#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #236#return; {1239#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:58:40,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {1239#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1239#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:58:40,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {1239#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} assume !(sll_circular_create_~len#1 > 1); {1238#false} is VALID [2022-02-20 23:58:40,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {1238#false} assume !(1 == #valid[sll_circular_create_~last~0#1.base]); {1238#false} is VALID [2022-02-20 23:58:40,475 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:58:40,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:40,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67952645] [2022-02-20 23:58:40,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67952645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:40,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:40,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:58:40,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834227021] [2022-02-20 23:58:40,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:40,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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:58:40,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:40,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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:58:40,485 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:58:40,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:58:40,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:40,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:58:40,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:58:40,487 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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:58:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,742 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-02-20 23:58:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:58:40,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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:58:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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:58:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-02-20 23:58:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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:58:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-02-20 23:58:40,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-02-20 23:58:40,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:40,851 INFO L225 Difference]: With dead ends: 141 [2022-02-20 23:58:40,851 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 23:58:40,851 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:58:40,852 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 5 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:40,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 338 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 23:58:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2022-02-20 23:58:40,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:40,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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:58:40,857 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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:58:40,857 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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:58:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,862 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-02-20 23:58:40,862 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2022-02-20 23:58:40,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:40,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:40,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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 141 states. [2022-02-20 23:58:40,863 INFO L87 Difference]: Start difference. First operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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 141 states. [2022-02-20 23:58:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,868 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-02-20 23:58:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2022-02-20 23:58:40,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:40,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:40,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:40,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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:58:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2022-02-20 23:58:40,873 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 13 [2022-02-20 23:58:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:40,873 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2022-02-20 23:58:40,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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:58:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2022-02-20 23:58:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:58:40,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:40,874 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:40,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:58:40,874 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:40,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022556, now seen corresponding path program 1 times [2022-02-20 23:58:40,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:40,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274044742] [2022-02-20 23:58:40,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:40,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:58:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:40,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {1826#(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; {1808#true} is VALID [2022-02-20 23:58:40,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {1808#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1808#true} is VALID [2022-02-20 23:58:40,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {1808#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1808#true} is VALID [2022-02-20 23:58:40,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {1808#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1808#true} is VALID [2022-02-20 23:58:40,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {1808#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1808#true} is VALID [2022-02-20 23:58:40,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {1808#true} assume true; {1808#true} is VALID [2022-02-20 23:58:40,940 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1808#true} {1808#true} #236#return; {1808#true} is VALID [2022-02-20 23:58:40,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:58:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:40,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {1826#(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; {1808#true} is VALID [2022-02-20 23:58:40,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {1808#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1808#true} is VALID [2022-02-20 23:58:40,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {1808#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1827#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:40,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {1827#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1827#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:40,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {1827#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1828#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:40,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {1828#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1828#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:40,967 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1828#(= (select |#valid| |node_create_#res#1.base|) 1)} {1808#true} #238#return; {1824#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:58:40,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {1808#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); {1808#true} is VALID [2022-02-20 23:58:40,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {1808#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1808#true} is VALID [2022-02-20 23:58:40,968 INFO L272 TraceCheckUtils]: 2: Hoare triple {1808#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1826#(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:58:40,968 INFO L290 TraceCheckUtils]: 3: Hoare triple {1826#(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; {1808#true} is VALID [2022-02-20 23:58:40,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {1808#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1808#true} is VALID [2022-02-20 23:58:40,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {1808#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1808#true} is VALID [2022-02-20 23:58:40,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {1808#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1808#true} is VALID [2022-02-20 23:58:40,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {1808#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1808#true} is VALID [2022-02-20 23:58:40,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {1808#true} assume true; {1808#true} is VALID [2022-02-20 23:58:40,970 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1808#true} {1808#true} #236#return; {1808#true} is VALID [2022-02-20 23:58:40,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {1808#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1808#true} is VALID [2022-02-20 23:58:40,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {1808#true} assume !!(sll_circular_create_~len#1 > 1); {1808#true} is VALID [2022-02-20 23:58:40,971 INFO L272 TraceCheckUtils]: 12: Hoare triple {1808#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1826#(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:58:40,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {1826#(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; {1808#true} is VALID [2022-02-20 23:58:40,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {1808#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1808#true} is VALID [2022-02-20 23:58:40,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {1808#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1827#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:40,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {1827#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1827#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:40,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {1827#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1828#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:40,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1828#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:40,973 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1828#(= (select |#valid| |node_create_#res#1.base|) 1)} {1808#true} #238#return; {1824#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:58:40,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {1824#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {1825#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:40,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {1825#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)} assume !(1 == #valid[sll_circular_create_~new_head~0#1.base]); {1809#false} is VALID [2022-02-20 23:58:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:58:40,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:40,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274044742] [2022-02-20 23:58:40,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274044742] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:40,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:40,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:58:40,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367371213] [2022-02-20 23:58:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:40,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 23:58:40,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:40,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:40,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:40,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:40,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:40,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:40,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:40,990 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:41,629 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2022-02-20 23:58:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:58:41,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 23:58:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:41,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2022-02-20 23:58:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2022-02-20 23:58:41,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 149 transitions. [2022-02-20 23:58:41,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:41,740 INFO L225 Difference]: With dead ends: 135 [2022-02-20 23:58:41,740 INFO L226 Difference]: Without dead ends: 135 [2022-02-20 23:58:41,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:58:41,742 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 13 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:41,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 488 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:58:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-20 23:58:41,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2022-02-20 23:58:41,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:41,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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:58:41,747 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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:58:41,747 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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:58:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:41,753 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2022-02-20 23:58:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2022-02-20 23:58:41,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:41,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:41,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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 135 states. [2022-02-20 23:58:41,755 INFO L87 Difference]: Start difference. First operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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 135 states. [2022-02-20 23:58:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:41,758 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2022-02-20 23:58:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2022-02-20 23:58:41,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:41,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:41,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:41,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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:58:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-02-20 23:58:41,762 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 22 [2022-02-20 23:58:41,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:41,763 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-02-20 23:58:41,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-02-20 23:58:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:58:41,764 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:41,764 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:41,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:58:41,764 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:41,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:41,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022557, now seen corresponding path program 1 times [2022-02-20 23:58:41,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:41,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455860679] [2022-02-20 23:58:41,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:41,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:58:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:41,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {2390#(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; {2372#true} is VALID [2022-02-20 23:58:41,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {2372#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2372#true} is VALID [2022-02-20 23:58:41,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {2372#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2372#true} is VALID [2022-02-20 23:58:41,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {2372#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2372#true} is VALID [2022-02-20 23:58:41,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {2372#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2372#true} is VALID [2022-02-20 23:58:41,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {2372#true} assume true; {2372#true} is VALID [2022-02-20 23:58:41,838 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2372#true} {2372#true} #236#return; {2372#true} is VALID [2022-02-20 23:58:41,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:58:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:41,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {2390#(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; {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:41,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:41,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:41,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:41,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2392#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:58:41,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {2392#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} assume true; {2392#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:58:41,873 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2392#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} {2372#true} #238#return; {2388#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 8))} is VALID [2022-02-20 23:58:41,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {2372#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); {2372#true} is VALID [2022-02-20 23:58:41,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {2372#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {2372#true} is VALID [2022-02-20 23:58:41,874 INFO L272 TraceCheckUtils]: 2: Hoare triple {2372#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2390#(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:58:41,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {2390#(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; {2372#true} is VALID [2022-02-20 23:58:41,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {2372#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2372#true} is VALID [2022-02-20 23:58:41,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {2372#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2372#true} is VALID [2022-02-20 23:58:41,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {2372#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2372#true} is VALID [2022-02-20 23:58:41,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {2372#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2372#true} is VALID [2022-02-20 23:58:41,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {2372#true} assume true; {2372#true} is VALID [2022-02-20 23:58:41,875 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2372#true} {2372#true} #236#return; {2372#true} is VALID [2022-02-20 23:58:41,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {2372#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2372#true} is VALID [2022-02-20 23:58:41,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {2372#true} assume !!(sll_circular_create_~len#1 > 1); {2372#true} is VALID [2022-02-20 23:58:41,876 INFO L272 TraceCheckUtils]: 12: Hoare triple {2372#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {2390#(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:58:41,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {2390#(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; {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:41,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:41,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:41,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:41,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {2391#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2392#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:58:41,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {2392#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} assume true; {2392#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:58:41,882 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2392#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} {2372#true} #238#return; {2388#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 8))} is VALID [2022-02-20 23:58:41,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {2388#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 8))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {2389#(and (= (+ (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:58:41,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {2389#(and (= (+ (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))} assume !(4 + sll_circular_create_~new_head~0#1.offset <= #length[sll_circular_create_~new_head~0#1.base] && 0 <= sll_circular_create_~new_head~0#1.offset); {2373#false} is VALID [2022-02-20 23:58:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:41,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:41,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455860679] [2022-02-20 23:58:41,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455860679] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:41,885 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:41,885 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:58:41,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545698215] [2022-02-20 23:58:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:41,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 23:58:41,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:41,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:41,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:41,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:41,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:41,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:41,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:41,901 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:42,552 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-02-20 23:58:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:58:42,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 23:58:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-02-20 23:58:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-02-20 23:58:42,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 148 transitions. [2022-02-20 23:58:42,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:42,653 INFO L225 Difference]: With dead ends: 134 [2022-02-20 23:58:42,653 INFO L226 Difference]: Without dead ends: 134 [2022-02-20 23:58:42,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:58:42,654 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 11 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:42,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 512 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:58:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-20 23:58:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-02-20 23:58:42,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:42,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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:58:42,658 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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:58:42,658 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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:58:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:42,661 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-02-20 23:58:42,661 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2022-02-20 23:58:42,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:42,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:42,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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 134 states. [2022-02-20 23:58:42,662 INFO L87 Difference]: Start difference. First operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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 134 states. [2022-02-20 23:58:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:42,664 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-02-20 23:58:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2022-02-20 23:58:42,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:42,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:42,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:42,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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:58:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-02-20 23:58:42,668 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 22 [2022-02-20 23:58:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:42,668 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-02-20 23:58:42,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-02-20 23:58:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:58:42,669 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:42,669 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:42,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:58:42,669 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:42,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216453, now seen corresponding path program 1 times [2022-02-20 23:58:42,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:42,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343147890] [2022-02-20 23:58:42,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:42,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:58:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {2950#(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; {2932#true} is VALID [2022-02-20 23:58:42,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2932#true} is VALID [2022-02-20 23:58:42,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:42,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:42,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:42,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:42,744 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} {2932#true} #236#return; {2941#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:58:42,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:58:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {2950#(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; {2953#(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:58:42,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {2953#(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); {2953#(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:58:42,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {2953#(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, ~temp~0#1.offset, 4); srcloc: L576-1 {2953#(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:58:42,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {2953#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2953#(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:58:42,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {2953#(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; {2954#(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:58:42,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {2954#(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; {2954#(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:58:42,788 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2954#(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|))} {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} #238#return; {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {2932#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); {2932#true} is VALID [2022-02-20 23:58:42,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {2932#true} is VALID [2022-02-20 23:58:42,789 INFO L272 TraceCheckUtils]: 2: Hoare triple {2932#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2950#(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:58:42,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {2950#(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; {2932#true} is VALID [2022-02-20 23:58:42,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {2932#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2932#true} is VALID [2022-02-20 23:58:42,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:42,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:42,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:42,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:42,792 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} {2932#true} #236#return; {2941#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:58:42,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {2941#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !!(sll_circular_create_~len#1 > 1); {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,793 INFO L272 TraceCheckUtils]: 12: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {2950#(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:58:42,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {2950#(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; {2953#(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:58:42,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {2953#(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); {2953#(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:58:42,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {2953#(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, ~temp~0#1.offset, 4); srcloc: L576-1 {2953#(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:58:42,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {2953#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2953#(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:58:42,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {2953#(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; {2954#(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:58:42,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {2954#(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; {2954#(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:58:42,798 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2954#(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|))} {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} #238#return; {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !(sll_circular_create_~len#1 > 1); {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !(1 == #valid[sll_circular_create_~last~0#1.base]); {2933#false} is VALID [2022-02-20 23:58:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:58:42,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:42,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343147890] [2022-02-20 23:58:42,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343147890] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:42,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072163123] [2022-02-20 23:58:42,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:42,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:42,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:42,802 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:58:42,829 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:58:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:58:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:42,963 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:58:43,081 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:58:43,082 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:58:43,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {2932#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); {2932#true} is VALID [2022-02-20 23:58:43,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {2932#true} is VALID [2022-02-20 23:58:43,146 INFO L272 TraceCheckUtils]: 2: Hoare triple {2932#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2932#true} is VALID [2022-02-20 23:58:43,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {2932#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; {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:43,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:43,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:43,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:43,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:43,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:43,149 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} {2932#true} #236#return; {2941#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:58:43,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {2941#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:43,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !!(sll_circular_create_~len#1 > 1); {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:43,150 INFO L272 TraceCheckUtils]: 12: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {2994#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:58:43,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {2994#(= |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; {2998#(exists ((v_ArrVal_256 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_256) |#valid|))} is VALID [2022-02-20 23:58:43,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {2998#(exists ((v_ArrVal_256 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_256) |#valid|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2998#(exists ((v_ArrVal_256 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_256) |#valid|))} is VALID [2022-02-20 23:58:43,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {2998#(exists ((v_ArrVal_256 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_256) |#valid|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2998#(exists ((v_ArrVal_256 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_256) |#valid|))} is VALID [2022-02-20 23:58:43,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {2998#(exists ((v_ArrVal_256 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_256) |#valid|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2998#(exists ((v_ArrVal_256 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_256) |#valid|))} is VALID [2022-02-20 23:58:43,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {2998#(exists ((v_ArrVal_256 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_256) |#valid|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3011#(exists ((v_ArrVal_256 Int)) (= |#valid| (store |old(#valid)| |node_create_#res#1.base| v_ArrVal_256)))} is VALID [2022-02-20 23:58:43,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {3011#(exists ((v_ArrVal_256 Int)) (= |#valid| (store |old(#valid)| |node_create_#res#1.base| v_ArrVal_256)))} assume true; {3011#(exists ((v_ArrVal_256 Int)) (= |#valid| (store |old(#valid)| |node_create_#res#1.base| v_ArrVal_256)))} is VALID [2022-02-20 23:58:43,155 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3011#(exists ((v_ArrVal_256 Int)) (= |#valid| (store |old(#valid)| |node_create_#res#1.base| v_ArrVal_256)))} {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} #238#return; {3018#(or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:58:43,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {3018#(or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {3022#(or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:58:43,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {3022#(or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:43,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:43,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !(sll_circular_create_~len#1 > 1); {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:43,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !(1 == #valid[sll_circular_create_~last~0#1.base]); {2933#false} is VALID [2022-02-20 23:58:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:43,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:43,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !(1 == #valid[sll_circular_create_~last~0#1.base]); {2933#false} is VALID [2022-02-20 23:58:43,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !(sll_circular_create_~len#1 > 1); {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:43,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:43,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {3044#(or (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:43,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {3048#(or (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {3044#(or (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:58:43,556 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3055#(or (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1)))) (not (= (select |#valid| |node_create_#res#1.base|) 1)))} {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} #238#return; {3048#(or (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:58:43,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {3055#(or (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1)))) (not (= (select |#valid| |node_create_#res#1.base|) 1)))} assume true; {3055#(or (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1)))) (not (= (select |#valid| |node_create_#res#1.base|) 1)))} is VALID [2022-02-20 23:58:43,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {3062#(or (not (= 1 (select |#valid| |node_create_~temp~0#1.base|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3055#(or (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1)))) (not (= (select |#valid| |node_create_#res#1.base|) 1)))} is VALID [2022-02-20 23:58:43,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {3062#(or (not (= 1 (select |#valid| |node_create_~temp~0#1.base|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1)))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3062#(or (not (= 1 (select |#valid| |node_create_~temp~0#1.base|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1)))))} is VALID [2022-02-20 23:58:43,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {3062#(or (not (= 1 (select |#valid| |node_create_~temp~0#1.base|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1)))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3062#(or (not (= 1 (select |#valid| |node_create_~temp~0#1.base|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1)))))} is VALID [2022-02-20 23:58:43,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {3062#(or (not (= 1 (select |#valid| |node_create_~temp~0#1.base|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1)))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3062#(or (not (= 1 (select |#valid| |node_create_~temp~0#1.base|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1)))))} is VALID [2022-02-20 23:58:43,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {3075#(forall ((|v_node_create_~temp~0#1.base_14| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select (store |#valid| |v_node_create_~temp~0#1.base_14| 1) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1))))} ~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; {3062#(or (not (= 1 (select |#valid| |node_create_~temp~0#1.base|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1)))))} is VALID [2022-02-20 23:58:43,563 INFO L272 TraceCheckUtils]: 12: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3075#(forall ((|v_node_create_~temp~0#1.base_14| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (or (= (select (store |#valid| |v_node_create_~temp~0#1.base_14| 1) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:58:43,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !!(sll_circular_create_~len#1 > 1); {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:43,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {2941#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2942#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:43,565 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} {2932#true} #236#return; {2941#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:58:43,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:43,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2952#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:43,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:43,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:43,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:43,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {2932#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; {2951#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:43,567 INFO L272 TraceCheckUtils]: 2: Hoare triple {2932#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2932#true} is VALID [2022-02-20 23:58:43,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {2932#true} is VALID [2022-02-20 23:58:43,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {2932#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); {2932#true} is VALID [2022-02-20 23:58:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:43,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072163123] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:43,568 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:43,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-02-20 23:58:43,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521040114] [2022-02-20 23:58:43,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:43,569 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 23:58:43,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:43,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:58:43,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:43,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 23:58:43,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:43,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 23:58:43,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:58:43,608 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:58:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:44,339 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2022-02-20 23:58:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:58:44,340 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 23:58:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:58:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2022-02-20 23:58:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:58:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2022-02-20 23:58:44,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 150 transitions. [2022-02-20 23:58:44,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:44,418 INFO L225 Difference]: With dead ends: 139 [2022-02-20 23:58:44,418 INFO L226 Difference]: Without dead ends: 139 [2022-02-20 23:58:44,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:58:44,419 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 42 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:44,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 712 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 395 Invalid, 0 Unknown, 155 Unchecked, 0.2s Time] [2022-02-20 23:58:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-20 23:58:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-20 23:58:44,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:44,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 79 states have (on average 1.8227848101265822) internal successors, (144), 133 states have internal predecessors, (144), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:44,423 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 79 states have (on average 1.8227848101265822) internal successors, (144), 133 states have internal predecessors, (144), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:44,423 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 79 states have (on average 1.8227848101265822) internal successors, (144), 133 states have internal predecessors, (144), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:44,426 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2022-02-20 23:58:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2022-02-20 23:58:44,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:44,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:44,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 79 states have (on average 1.8227848101265822) internal successors, (144), 133 states have internal predecessors, (144), 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 139 states. [2022-02-20 23:58:44,427 INFO L87 Difference]: Start difference. First operand has 139 states, 79 states have (on average 1.8227848101265822) internal successors, (144), 133 states have internal predecessors, (144), 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 139 states. [2022-02-20 23:58:44,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:44,434 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2022-02-20 23:58:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2022-02-20 23:58:44,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:44,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:44,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:44,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 79 states have (on average 1.8227848101265822) internal successors, (144), 133 states have internal predecessors, (144), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2022-02-20 23:58:44,450 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 25 [2022-02-20 23:58:44,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:44,450 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2022-02-20 23:58:44,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:58:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2022-02-20 23:58:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:58:44,451 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:44,451 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:44,470 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:58:44,665 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:58:44,665 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:44,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:44,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216454, now seen corresponding path program 1 times [2022-02-20 23:58:44,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:44,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64507758] [2022-02-20 23:58:44,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:44,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:44,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:58:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:44,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {3694#(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; {3695#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:44,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {3695#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3695#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:44,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {3695#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3696#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:44,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {3696#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3696#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:44,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {3696#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3697#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:58:44,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {3697#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {3697#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:58:44,847 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3697#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {3675#true} #236#return; {3684#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:58:44,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:58:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:44,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {3694#(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; {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:44,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:44,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:44,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:44,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3699#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:58:44,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {3699#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} assume true; {3699#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:58:44,918 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3699#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} {3685#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #238#return; {3693#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:44,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {3675#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); {3675#true} is VALID [2022-02-20 23:58:44,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {3675#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {3675#true} is VALID [2022-02-20 23:58:44,919 INFO L272 TraceCheckUtils]: 2: Hoare triple {3675#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {3694#(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:58:44,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {3694#(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; {3695#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:44,919 INFO L290 TraceCheckUtils]: 4: Hoare triple {3695#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3695#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:44,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {3695#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3696#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:44,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {3696#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3696#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:58:44,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {3696#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3697#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:58:44,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {3697#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {3697#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:58:44,922 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3697#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {3675#true} #236#return; {3684#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:58:44,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {3684#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3685#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:58:44,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {3685#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} assume !!(sll_circular_create_~len#1 > 1); {3685#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:58:44,923 INFO L272 TraceCheckUtils]: 12: Hoare triple {3685#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3694#(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:58:44,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {3694#(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; {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:44,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:44,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:44,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:44,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3699#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:58:44,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {3699#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} assume true; {3699#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:58:44,928 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3699#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} {3685#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #238#return; {3693#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:44,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {3693#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {3693#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:44,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {3693#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {3693#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:44,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {3693#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {3693#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:44,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {3693#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(sll_circular_create_~len#1 > 1); {3693#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:44,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {3693#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(4 + sll_circular_create_~last~0#1.offset <= #length[sll_circular_create_~last~0#1.base] && 0 <= sll_circular_create_~last~0#1.offset); {3676#false} is VALID [2022-02-20 23:58:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:44,932 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:44,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64507758] [2022-02-20 23:58:44,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64507758] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:44,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482705835] [2022-02-20 23:58:44,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:44,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:44,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:44,935 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:58:44,946 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:58:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:45,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 23:58:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:45,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:45,059 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:58:45,318 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:45,318 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-20 23:58:45,326 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 16 treesize of output 11 [2022-02-20 23:58:45,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {3675#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); {3675#true} is VALID [2022-02-20 23:58:45,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {3675#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {3675#true} is VALID [2022-02-20 23:58:45,395 INFO L272 TraceCheckUtils]: 2: Hoare triple {3675#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {3675#true} is VALID [2022-02-20 23:58:45,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {3675#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; {3712#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:58:45,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {3712#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3712#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:58:45,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {3712#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3712#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:58:45,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {3712#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3722#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|) (<= (+ |node_create_~temp~0#1.offset| 8) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:45,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {3722#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|) (<= (+ |node_create_~temp~0#1.offset| 8) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3726#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:58:45,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {3726#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {3726#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:58:45,404 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3726#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} {3675#true} #236#return; {3733#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:58:45,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {3733#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3737#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:45,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {3737#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !!(sll_circular_create_~len#1 > 1); {3737#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:45,410 INFO L272 TraceCheckUtils]: 12: Hoare triple {3737#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3744#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:58:45,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {3744#(and (= |old(#length)| |#length|) (= |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; {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:45,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:45,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:45,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:58:45,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {3698#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3760#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (store |old(#length)| |node_create_#res#1.base| (select |#length| |node_create_#res#1.base|)) |#length|))} is VALID [2022-02-20 23:58:45,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {3760#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (store |old(#length)| |node_create_#res#1.base| (select |#length| |node_create_#res#1.base|)) |#length|))} assume true; {3760#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (store |old(#length)| |node_create_#res#1.base| (select |#length| |node_create_#res#1.base|)) |#length|))} is VALID [2022-02-20 23:58:45,417 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3760#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (store |old(#length)| |node_create_#res#1.base| (select |#length| |node_create_#res#1.base|)) |#length|))} {3737#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} #238#return; {3767#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:45,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {3767#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {3771#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:45,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {3771#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {3771#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:45,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {3771#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {3771#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:45,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {3771#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(sll_circular_create_~len#1 > 1); {3771#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:45,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {3771#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(4 + sll_circular_create_~last~0#1.offset <= #length[sll_circular_create_~last~0#1.base] && 0 <= sll_circular_create_~last~0#1.offset); {3676#false} is VALID [2022-02-20 23:58:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:45,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:45,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482705835] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:45,621 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:58:45,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-02-20 23:58:45,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383592356] [2022-02-20 23:58:45,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:45,622 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-02-20 23:58:45,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:45,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:45,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:45,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 23:58:45,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:45,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 23:58:45,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:58:45,656 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:47,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:47,829 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2022-02-20 23:58:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:58:47,829 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-02-20 23:58:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-02-20 23:58:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-02-20 23:58:47,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-02-20 23:58:47,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:47,937 INFO L225 Difference]: With dead ends: 140 [2022-02-20 23:58:47,937 INFO L226 Difference]: Without dead ends: 140 [2022-02-20 23:58:47,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:58:47,938 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 259 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:47,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 830 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 23:58:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-02-20 23:58:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-02-20 23:58:47,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:47,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 138 states, 79 states have (on average 1.8101265822784811) internal successors, (143), 132 states have internal predecessors, (143), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:47,941 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 138 states, 79 states have (on average 1.8101265822784811) internal successors, (143), 132 states have internal predecessors, (143), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:47,941 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 138 states, 79 states have (on average 1.8101265822784811) internal successors, (143), 132 states have internal predecessors, (143), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:47,943 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2022-02-20 23:58:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2022-02-20 23:58:47,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:47,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:47,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 79 states have (on average 1.8101265822784811) internal successors, (143), 132 states have internal predecessors, (143), 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 140 states. [2022-02-20 23:58:47,944 INFO L87 Difference]: Start difference. First operand has 138 states, 79 states have (on average 1.8101265822784811) internal successors, (143), 132 states have internal predecessors, (143), 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 140 states. [2022-02-20 23:58:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:47,947 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2022-02-20 23:58:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2022-02-20 23:58:47,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:47,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:47,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:47,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 79 states have (on average 1.8101265822784811) internal successors, (143), 132 states have internal predecessors, (143), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2022-02-20 23:58:47,949 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 25 [2022-02-20 23:58:47,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:47,949 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2022-02-20 23:58:47,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2022-02-20 23:58:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 23:58:47,950 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:47,950 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:47,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:48,167 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:58:48,167 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:48,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:48,168 INFO L85 PathProgramCache]: Analyzing trace with hash -148939745, now seen corresponding path program 1 times [2022-02-20 23:58:48,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:48,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278782867] [2022-02-20 23:58:48,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:48,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:48,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:58:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:48,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {4393#(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; {4394#(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:58:48,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {4394#(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); {4394#(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:58:48,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {4394#(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, ~temp~0#1.offset, 4); srcloc: L576-1 {4394#(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:58:48,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {4394#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4394#(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:58:48,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {4394#(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; {4395#(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:58:48,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {4395#(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; {4395#(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:58:48,284 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4395#(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|))} {4369#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #236#return; {4369#(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:58:48,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:58:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:48,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {4393#(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; {4394#(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:58:48,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {4394#(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); {4394#(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:58:48,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {4394#(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, ~temp~0#1.offset, 4); srcloc: L576-1 {4394#(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:58:48,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {4394#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4394#(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:58:48,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {4394#(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; {4395#(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:58:48,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {4395#(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; {4395#(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:58:48,310 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4395#(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|))} {4369#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #238#return; {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 23:58:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:48,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {4393#(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; {4396#(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:58:48,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {4396#(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); {4396#(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:58:48,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {4396#(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, ~temp~0#1.offset, 4); srcloc: L576-1 {4396#(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:58:48,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {4396#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4396#(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:58:48,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {4396#(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; {4397#(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:58:48,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {4397#(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; {4397#(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:58:48,351 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4397#(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|))} {4385#(= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)} #240#return; {4385#(= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)} is VALID [2022-02-20 23:58:48,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {4367#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); {4367#true} is VALID [2022-02-20 23:58:48,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {4367#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4369#(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:58:48,353 INFO L272 TraceCheckUtils]: 2: Hoare triple {4369#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4393#(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:58:48,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {4393#(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; {4394#(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:58:48,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {4394#(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); {4394#(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:58:48,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {4394#(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, ~temp~0#1.offset, 4); srcloc: L576-1 {4394#(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:58:48,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {4394#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4394#(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:58:48,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {4394#(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; {4395#(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:58:48,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {4395#(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; {4395#(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:58:48,358 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4395#(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|))} {4369#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #236#return; {4369#(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:58:48,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {4369#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4369#(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:58:48,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {4369#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !!(sll_circular_create_~len#1 > 1); {4369#(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:58:48,360 INFO L272 TraceCheckUtils]: 12: Hoare triple {4369#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {4393#(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:58:48,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {4393#(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; {4394#(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:58:48,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {4394#(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); {4394#(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:58:48,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {4394#(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, ~temp~0#1.offset, 4); srcloc: L576-1 {4394#(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:58:48,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {4394#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4394#(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:58:48,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {4394#(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; {4395#(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:58:48,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {4395#(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; {4395#(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:58:48,365 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4395#(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|))} {4369#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #238#return; {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:48,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:48,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:48,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:48,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(sll_circular_create_~len#1 > 1); {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:48,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:48,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:48,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {4384#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#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_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_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_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {4385#(= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)} is VALID [2022-02-20 23:58:48,368 INFO L272 TraceCheckUtils]: 27: Hoare triple {4385#(= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {4393#(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:58:48,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {4393#(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; {4396#(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:58:48,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {4396#(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); {4396#(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:58:48,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {4396#(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, ~temp~0#1.offset, 4); srcloc: L576-1 {4396#(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:58:48,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {4396#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4396#(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:58:48,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {4396#(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; {4397#(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:58:48,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {4397#(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; {4397#(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:58:48,373 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4397#(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|))} {4385#(= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)} #240#return; {4385#(= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)} is VALID [2022-02-20 23:58:48,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {4385#(= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0; {4385#(= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)} is VALID [2022-02-20 23:58:48,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {4385#(= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)} assume !(1 == #valid[sll_circular_insert_~head#1.base]); {4368#false} is VALID [2022-02-20 23:58:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:58:48,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:48,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278782867] [2022-02-20 23:58:48,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278782867] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:48,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747961093] [2022-02-20 23:58:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:48,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:48,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:48,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:58:48,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:58:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:48,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:58:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:48,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:48,583 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:58:48,621 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:58:48,801 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:58:48,997 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 23:58:49,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:49,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:49,215 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 198195 column 46: unknown constant v_#valid_BEFORE_CALL_13 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:58:49,219 INFO L158 Benchmark]: Toolchain (without parser) took 11151.93ms. Allocated memory was 98.6MB in the beginning and 209.7MB in the end (delta: 111.1MB). Free memory was 64.5MB in the beginning and 128.5MB in the end (delta: -64.0MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2022-02-20 23:58:49,219 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:58:49,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.94ms. Allocated memory is still 98.6MB. Free memory was 64.3MB in the beginning and 63.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:58:49,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.33ms. Allocated memory is still 98.6MB. Free memory was 63.0MB in the beginning and 60.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:58:49,220 INFO L158 Benchmark]: Boogie Preprocessor took 29.23ms. Allocated memory is still 98.6MB. Free memory was 60.1MB in the beginning and 57.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:58:49,220 INFO L158 Benchmark]: RCFGBuilder took 706.92ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 57.7MB in the beginning and 76.6MB in the end (delta: -18.9MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2022-02-20 23:58:49,220 INFO L158 Benchmark]: TraceAbstraction took 9992.74ms. Allocated memory was 119.5MB in the beginning and 209.7MB in the end (delta: 90.2MB). Free memory was 76.0MB in the beginning and 129.0MB in the end (delta: -53.0MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2022-02-20 23:58:49,221 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.15ms. Allocated memory is still 98.6MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.94ms. Allocated memory is still 98.6MB. Free memory was 64.3MB in the beginning and 63.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.33ms. Allocated memory is still 98.6MB. Free memory was 63.0MB in the beginning and 60.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.23ms. Allocated memory is still 98.6MB. Free memory was 60.1MB in the beginning and 57.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 706.92ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 57.7MB in the beginning and 76.6MB in the end (delta: -18.9MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9992.74ms. Allocated memory was 119.5MB in the beginning and 209.7MB in the end (delta: 90.2MB). Free memory was 76.0MB in the beginning and 129.0MB in the end (delta: -53.0MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 198195 column 46: unknown constant v_#valid_BEFORE_CALL_13 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 198195 column 46: unknown constant v_#valid_BEFORE_CALL_13: 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:58:49,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 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/sll2c_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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:58:50,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:58:50,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:58:51,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:58:51,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:58:51,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:58:51,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:58:51,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:58:51,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:58:51,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:58:51,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:58:51,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:58:51,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:58:51,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:58:51,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:58:51,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:58:51,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:58:51,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:58:51,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:58:51,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:58:51,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:58:51,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:58:51,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:58:51,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:58:51,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:58:51,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:58:51,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:58:51,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:58:51,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:58:51,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:58:51,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:58:51,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:58:51,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:58:51,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:58:51,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:58:51,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:58:51,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:58:51,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:58:51,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:58:51,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:58:51,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:58:51,049 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:58:51,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:58:51,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:58:51,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:58:51,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:58:51,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:58:51,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:58:51,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:58:51,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:58:51,075 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:58:51,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:58:51,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:58:51,076 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:58:51,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:58:51,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:58:51,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:58:51,077 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:58:51,077 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:58:51,077 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:58:51,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:58:51,077 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:58:51,077 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:58:51,077 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:58:51,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:58:51,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:58:51,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:58:51,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:58:51,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:58:51,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:58:51,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:58:51,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:58:51,078 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:58:51,078 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:58:51,078 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:58:51,079 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2022-02-20 23:58:51,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:58:51,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:58:51,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:58:51,355 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:58:51,355 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:58:51,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-02-20 23:58:51,404 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfda3b11/75de6369981e4394902d2e6bbb74a7d9/FLAG517774e7b [2022-02-20 23:58:51,805 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:58:51,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-02-20 23:58:51,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfda3b11/75de6369981e4394902d2e6bbb74a7d9/FLAG517774e7b [2022-02-20 23:58:51,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfda3b11/75de6369981e4394902d2e6bbb74a7d9 [2022-02-20 23:58:51,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:58:51,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:58:51,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:58:51,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:58:51,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:58:51,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:58:51" (1/1) ... [2022-02-20 23:58:51,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1bc98f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:51, skipping insertion in model container [2022-02-20 23:58:51,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:58:51" (1/1) ... [2022-02-20 23:58:51,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:58:51,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:58:52,180 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/sll2c_insert_unequal.i[24872,24885] [2022-02-20 23:58:52,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:58:52,200 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:58:52,248 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/sll2c_insert_unequal.i[24872,24885] [2022-02-20 23:58:52,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:58:52,274 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:58:52,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:52 WrapperNode [2022-02-20 23:58:52,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:58:52,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:58:52,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:58:52,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:58:52,280 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:58:52" (1/1) ... [2022-02-20 23:58:52,300 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:58:52" (1/1) ... [2022-02-20 23:58:52,323 INFO L137 Inliner]: procedures = 130, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 179 [2022-02-20 23:58:52,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:58:52,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:58:52,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:58:52,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:58:52,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:52" (1/1) ... [2022-02-20 23:58:52,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:52" (1/1) ... [2022-02-20 23:58:52,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:52" (1/1) ... [2022-02-20 23:58:52,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:52" (1/1) ... [2022-02-20 23:58:52,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:52" (1/1) ... [2022-02-20 23:58:52,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:52" (1/1) ... [2022-02-20 23:58:52,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:52" (1/1) ... [2022-02-20 23:58:52,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:58:52,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:58:52,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:58:52,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:58:52,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:52" (1/1) ... [2022-02-20 23:58:52,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:58:52,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:52,418 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:58:52,420 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:58:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:58:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 23:58:52,443 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 23:58:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:58:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:58:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:58:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:58:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:58:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:58:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:58:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:58:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:58:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:58:52,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:58:52,546 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:58:52,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:58:52,988 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:58:52,993 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:58:52,993 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:58:52,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:58:52 BoogieIcfgContainer [2022-02-20 23:58:52,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:58:52,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:58:52,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:58:52,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:58:52,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:58:51" (1/3) ... [2022-02-20 23:58:52,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5add3666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:58:52, skipping insertion in model container [2022-02-20 23:58:52,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:52" (2/3) ... [2022-02-20 23:58:52,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5add3666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:58:52, skipping insertion in model container [2022-02-20 23:58:52,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:58:52" (3/3) ... [2022-02-20 23:58:52,999 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2022-02-20 23:58:53,002 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:58:53,002 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-02-20 23:58:53,033 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:58:53,038 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:58:53,038 INFO L340 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-02-20 23:58:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 74 states have (on average 2.081081081081081) internal successors, (154), 136 states have internal predecessors, (154), 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:58:53,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:58:53,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:53,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:58:53,059 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:53,063 INFO L85 PathProgramCache]: Analyzing trace with hash 896568277, now seen corresponding path program 1 times [2022-02-20 23:58:53,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:53,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682678370] [2022-02-20 23:58:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:53,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:53,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:53,074 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:58:53,075 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:58:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:53,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:58:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:53,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:53,205 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:58:53,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {144#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); {144#true} is VALID [2022-02-20 23:58:53,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {144#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {144#true} is VALID [2022-02-20 23:58:53,220 INFO L272 TraceCheckUtils]: 2: Hoare triple {144#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {144#true} is VALID [2022-02-20 23:58:53,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {144#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; {158#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:53,222 INFO L290 TraceCheckUtils]: 4: Hoare triple {158#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {158#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:53,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[~temp~0#1.base]); {145#false} is VALID [2022-02-20 23:58:53,223 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:58:53,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:53,224 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:53,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682678370] [2022-02-20 23:58:53,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682678370] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:53,224 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:53,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:58:53,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307874956] [2022-02-20 23:58:53,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:53,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-02-20 23:58:53,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:53,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:53,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:53,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:53,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:53,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:53,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:53,253 INFO L87 Difference]: Start difference. First operand has 141 states, 74 states have (on average 2.081081081081081) internal successors, (154), 136 states have internal predecessors, (154), 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 has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:53,739 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2022-02-20 23:58:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:53,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-02-20 23:58:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2022-02-20 23:58:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2022-02-20 23:58:53,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2022-02-20 23:58:53,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:53,949 INFO L225 Difference]: With dead ends: 139 [2022-02-20 23:58:53,950 INFO L226 Difference]: Without dead ends: 136 [2022-02-20 23:58:53,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:58:53,954 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:53,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 225 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-02-20 23:58:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-02-20 23:58:53,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:53,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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:58:53,985 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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:58:53,988 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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:58:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:53,996 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2022-02-20 23:58:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-02-20 23:58:53,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:53,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:53,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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 136 states. [2022-02-20 23:58:53,999 INFO L87 Difference]: Start difference. First operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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 136 states. [2022-02-20 23:58:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:54,004 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2022-02-20 23:58:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-02-20 23:58:54,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:54,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:54,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:54,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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:58:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2022-02-20 23:58:54,010 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 6 [2022-02-20 23:58:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:54,011 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2022-02-20 23:58:54,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-02-20 23:58:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:58:54,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:54,012 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:58:54,020 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:58:54,218 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:58:54,218 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:54,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash 896568278, now seen corresponding path program 1 times [2022-02-20 23:58:54,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:54,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676254933] [2022-02-20 23:58:54,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:54,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:54,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:54,221 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:58:54,223 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:58:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:54,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:58:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:54,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:54,312 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:58:54,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {711#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); {711#true} is VALID [2022-02-20 23:58:54,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {711#true} is VALID [2022-02-20 23:58:54,338 INFO L272 TraceCheckUtils]: 2: Hoare triple {711#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {711#true} is VALID [2022-02-20 23:58:54,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {711#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; {725#(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:58:54,339 INFO L290 TraceCheckUtils]: 4: Hoare triple {725#(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); {725#(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:58:54,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {725#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~temp~0#1.offset), #length[~temp~0#1.base]) && ~bvule32(~temp~0#1.offset, ~bvadd32(4bv32, ~temp~0#1.offset))) && ~bvule32(0bv32, ~temp~0#1.offset)); {712#false} is VALID [2022-02-20 23:58:54,340 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:58:54,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:54,341 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:54,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676254933] [2022-02-20 23:58:54,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676254933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:54,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:54,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:58:54,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718479223] [2022-02-20 23:58:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:54,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-02-20 23:58:54,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:54,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:54,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:54,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:54,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:54,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:54,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:54,351 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:54,901 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2022-02-20 23:58:54,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:54,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-02-20 23:58:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-02-20 23:58:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-02-20 23:58:54,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 148 transitions. [2022-02-20 23:58:55,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:55,062 INFO L225 Difference]: With dead ends: 134 [2022-02-20 23:58:55,062 INFO L226 Difference]: Without dead ends: 134 [2022-02-20 23:58:55,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:58:55,063 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:55,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-20 23:58:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-02-20 23:58:55,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:55,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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:58:55,068 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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:58:55,069 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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:58:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:55,073 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2022-02-20 23:58:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-02-20 23:58:55,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:55,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:55,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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 134 states. [2022-02-20 23:58:55,074 INFO L87 Difference]: Start difference. First operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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 134 states. [2022-02-20 23:58:55,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:55,078 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2022-02-20 23:58:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-02-20 23:58:55,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:55,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:55,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:55,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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:58:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-02-20 23:58:55,082 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 6 [2022-02-20 23:58:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:55,082 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-02-20 23:58:55,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:58:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-02-20 23:58:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:58:55,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:55,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:55,100 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:58:55,290 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:58:55,290 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:55,291 INFO L85 PathProgramCache]: Analyzing trace with hash 24922967, now seen corresponding path program 1 times [2022-02-20 23:58:55,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:55,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981476326] [2022-02-20 23:58:55,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:55,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:55,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:55,316 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:58:55,318 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:58:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:55,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:58:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:55,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:55,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {1267#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); {1267#true} is VALID [2022-02-20 23:58:55,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {1267#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1275#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} is VALID [2022-02-20 23:58:55,423 INFO L272 TraceCheckUtils]: 2: Hoare triple {1275#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1267#true} is VALID [2022-02-20 23:58:55,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {1267#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; {1267#true} is VALID [2022-02-20 23:58:55,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {1267#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1267#true} is VALID [2022-02-20 23:58:55,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {1267#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {1267#true} is VALID [2022-02-20 23:58:55,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {1267#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {1267#true} is VALID [2022-02-20 23:58:55,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {1267#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1267#true} is VALID [2022-02-20 23:58:55,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {1267#true} assume true; {1267#true} is VALID [2022-02-20 23:58:55,425 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1267#true} {1275#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} #236#return; {1275#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} is VALID [2022-02-20 23:58:55,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {1275#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1275#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} is VALID [2022-02-20 23:58:55,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {1275#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {1268#false} is VALID [2022-02-20 23:58:55,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {1268#false} assume !(1bv1 == #valid[sll_circular_create_~last~0#1.base]); {1268#false} is VALID [2022-02-20 23:58:55,427 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:58:55,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:55,427 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:55,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981476326] [2022-02-20 23:58:55,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981476326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:55,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:55,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:58:55,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625697882] [2022-02-20 23:58:55,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:55,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 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:58:55,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:55,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:55,440 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:58:55,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:55,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:55,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:55,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:55,441 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:58:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:55,947 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-02-20 23:58:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:55,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 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:58:55,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2022-02-20 23:58:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2022-02-20 23:58:55,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2022-02-20 23:58:56,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:56,149 INFO L225 Difference]: With dead ends: 141 [2022-02-20 23:58:56,149 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 23:58:56,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:58:56,153 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 5 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 285 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-20 23:58:56,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 285 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 23:58:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2022-02-20 23:58:56,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:56,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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:58:56,168 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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:58:56,168 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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:58:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:56,173 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-02-20 23:58:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2022-02-20 23:58:56,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:56,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:56,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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 141 states. [2022-02-20 23:58:56,176 INFO L87 Difference]: Start difference. First operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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 141 states. [2022-02-20 23:58:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:56,180 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-02-20 23:58:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2022-02-20 23:58:56,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:56,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:56,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:56,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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:58:56,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2022-02-20 23:58:56,185 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 13 [2022-02-20 23:58:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:56,185 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2022-02-20 23:58:56,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2022-02-20 23:58:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:58:56,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:56,186 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:56,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:58:56,393 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-20 23:58:56,393 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022556, now seen corresponding path program 1 times [2022-02-20 23:58:56,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:56,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34722105] [2022-02-20 23:58:56,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:56,396 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-20 23:58:56,397 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-20 23:58:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:56,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:58:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:56,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:56,520 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:58:56,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {1866#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); {1866#true} is VALID [2022-02-20 23:58:56,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1866#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1866#true} is VALID [2022-02-20 23:58:56,560 INFO L272 TraceCheckUtils]: 2: Hoare triple {1866#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1866#true} is VALID [2022-02-20 23:58:56,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {1866#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; {1866#true} is VALID [2022-02-20 23:58:56,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {1866#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1866#true} is VALID [2022-02-20 23:58:56,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {1866#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {1866#true} is VALID [2022-02-20 23:58:56,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {1866#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {1866#true} is VALID [2022-02-20 23:58:56,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {1866#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1866#true} is VALID [2022-02-20 23:58:56,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {1866#true} assume true; {1866#true} is VALID [2022-02-20 23:58:56,561 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1866#true} {1866#true} #236#return; {1866#true} is VALID [2022-02-20 23:58:56,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {1866#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1866#true} is VALID [2022-02-20 23:58:56,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {1866#true} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {1866#true} is VALID [2022-02-20 23:58:56,562 INFO L272 TraceCheckUtils]: 12: Hoare triple {1866#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1866#true} is VALID [2022-02-20 23:58:56,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {1866#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; {1910#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:56,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {1910#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1910#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:56,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {1910#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {1910#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:56,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {1910#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {1910#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:56,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {1910#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1923#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:56,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {1923#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {1923#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:56,565 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1923#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {1866#true} #238#return; {1930#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:56,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {1930#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (_ bv1 1))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {1934#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:56,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {1934#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[sll_circular_create_~new_head~0#1.base]); {1867#false} is VALID [2022-02-20 23:58:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:56,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:56,567 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:56,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34722105] [2022-02-20 23:58:56,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34722105] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:56,567 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:56,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:58:56,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978368356] [2022-02-20 23:58:56,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:56,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 23:58:56,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:56,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:56,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:56,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:58:56,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:56,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:58:56,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:56,590 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:57,852 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2022-02-20 23:58:57,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:57,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 23:58:57,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2022-02-20 23:58:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2022-02-20 23:58:57,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 149 transitions. [2022-02-20 23:58:57,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:57,999 INFO L225 Difference]: With dead ends: 135 [2022-02-20 23:58:57,999 INFO L226 Difference]: Without dead ends: 135 [2022-02-20 23:58:57,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-20 23:58:58,000 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 12 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:58,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 439 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:58:58,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-20 23:58:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2022-02-20 23:58:58,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:58,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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:58:58,007 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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:58:58,008 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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:58:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:58,010 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2022-02-20 23:58:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2022-02-20 23:58:58,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:58,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:58,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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 135 states. [2022-02-20 23:58:58,012 INFO L87 Difference]: Start difference. First operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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 135 states. [2022-02-20 23:58:58,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:58,014 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2022-02-20 23:58:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2022-02-20 23:58:58,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:58,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:58,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:58,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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:58:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-02-20 23:58:58,018 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 22 [2022-02-20 23:58:58,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:58,018 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-02-20 23:58:58,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-02-20 23:58:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:58:58,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:58,019 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:58,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:58,225 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-20 23:58:58,225 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:58:58,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:58,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022557, now seen corresponding path program 1 times [2022-02-20 23:58:58,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:58,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084789693] [2022-02-20 23:58:58,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:58,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:58,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:58,227 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-20 23:58:58,229 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-20 23:58:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:58,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:58:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:58,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:58,400 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:58:58,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {2478#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); {2478#true} is VALID [2022-02-20 23:58:58,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {2478#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {2478#true} is VALID [2022-02-20 23:58:58,516 INFO L272 TraceCheckUtils]: 2: Hoare triple {2478#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2478#true} is VALID [2022-02-20 23:58:58,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {2478#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; {2478#true} is VALID [2022-02-20 23:58:58,517 INFO L290 TraceCheckUtils]: 4: Hoare triple {2478#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2478#true} is VALID [2022-02-20 23:58:58,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {2478#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {2478#true} is VALID [2022-02-20 23:58:58,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {2478#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {2478#true} is VALID [2022-02-20 23:58:58,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {2478#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2478#true} is VALID [2022-02-20 23:58:58,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {2478#true} assume true; {2478#true} is VALID [2022-02-20 23:58:58,517 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2478#true} {2478#true} #236#return; {2478#true} is VALID [2022-02-20 23:58:58,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {2478#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2478#true} is VALID [2022-02-20 23:58:58,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {2478#true} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {2478#true} is VALID [2022-02-20 23:58:58,518 INFO L272 TraceCheckUtils]: 12: Hoare triple {2478#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {2478#true} is VALID [2022-02-20 23:58:58,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {2478#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; {2522#(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:58:58,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {2522#(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); {2522#(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:58:58,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {2522#(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, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {2522#(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:58:58,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {2522#(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, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {2522#(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:58:58,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {2522#(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; {2535#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)))} is VALID [2022-02-20 23:58:58,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {2535#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)))} assume true; {2535#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)))} is VALID [2022-02-20 23:58:58,524 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2535#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)))} {2478#true} #238#return; {2542#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:58:58,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {2542#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (_ bv8 32)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {2546#(and (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:58:58,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {2546#(and (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (_ bv8 32)))} assume !((~bvule32(~bvadd32(4bv32, sll_circular_create_~new_head~0#1.offset), #length[sll_circular_create_~new_head~0#1.base]) && ~bvule32(sll_circular_create_~new_head~0#1.offset, ~bvadd32(4bv32, sll_circular_create_~new_head~0#1.offset))) && ~bvule32(0bv32, sll_circular_create_~new_head~0#1.offset)); {2479#false} is VALID [2022-02-20 23:58:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:58,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:58,525 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:58,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084789693] [2022-02-20 23:58:58,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084789693] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:58,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:58,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:58:58,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354992397] [2022-02-20 23:58:58,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:58,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 23:58:58,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:58,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:58,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:58,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:58:58,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:58,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:58:58,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:58,565 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:59,983 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-02-20 23:58:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:59,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 23:58:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2022-02-20 23:58:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2022-02-20 23:58:59,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 148 transitions. [2022-02-20 23:59:00,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:00,117 INFO L225 Difference]: With dead ends: 134 [2022-02-20 23:59:00,117 INFO L226 Difference]: Without dead ends: 134 [2022-02-20 23:59:00,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-20 23:59:00,117 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 11 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:00,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 463 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:59:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-20 23:59:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-02-20 23:59:00,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:00,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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:00,121 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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:00,121 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:00,123 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-02-20 23:59:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2022-02-20 23:59:00,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:00,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:00,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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 134 states. [2022-02-20 23:59:00,124 INFO L87 Difference]: Start difference. First operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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 134 states. [2022-02-20 23:59:00,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:00,126 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-02-20 23:59:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2022-02-20 23:59:00,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:00,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:00,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:00,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-02-20 23:59:00,129 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 22 [2022-02-20 23:59:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:00,129 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-02-20 23:59:00,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-02-20 23:59:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:59:00,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:00,129 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:00,153 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-20 23:59:00,336 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-20 23:59:00,336 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:59:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216453, now seen corresponding path program 1 times [2022-02-20 23:59:00,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:00,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429084438] [2022-02-20 23:59:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:00,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:00,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:00,338 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-20 23:59:00,340 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-20 23:59:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:00,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:59:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:00,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:00,507 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:00,667 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:59:00,667 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-20 23:59:00,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {3086#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); {3086#true} is VALID [2022-02-20 23:59:00,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {3086#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {3086#true} is VALID [2022-02-20 23:59:00,704 INFO L272 TraceCheckUtils]: 2: Hoare triple {3086#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {3086#true} is VALID [2022-02-20 23:59:00,704 INFO L290 TraceCheckUtils]: 3: Hoare triple {3086#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; {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3113#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {3113#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {3113#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,707 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3113#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {3086#true} #236#return; {3120#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {3120#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) (_ bv1 1))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,708 INFO L272 TraceCheckUtils]: 12: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3131#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:59:00,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {3131#(= |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; {3135#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_126 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_126) |#valid|))))} is VALID [2022-02-20 23:59:00,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {3135#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_126 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_126) |#valid|))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3135#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_126 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_126) |#valid|))))} is VALID [2022-02-20 23:59:00,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {3135#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_126 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_126) |#valid|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {3135#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_126 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_126) |#valid|))))} is VALID [2022-02-20 23:59:00,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {3135#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_126 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_126) |#valid|))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {3135#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_126 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_126) |#valid|))))} is VALID [2022-02-20 23:59:00,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {3135#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_126 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_126) |#valid|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3135#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_126 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_126) |#valid|))))} is VALID [2022-02-20 23:59:00,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {3135#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_126 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_126) |#valid|))))} assume true; {3135#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_126 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_126) |#valid|))))} is VALID [2022-02-20 23:59:00,715 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3135#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_126 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_126) |#valid|))))} {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} #238#return; {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} assume !(1bv1 == #valid[sll_circular_create_~last~0#1.base]); {3087#false} is VALID [2022-02-20 23:59:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:00,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:00,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} assume !(1bv1 == #valid[sll_circular_create_~last~0#1.base]); {3087#false} is VALID [2022-02-20 23:59:00,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,987 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} #238#return; {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume true; {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:00,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:00,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:00,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:00,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:00,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} ~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; {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:00,991 INFO L272 TraceCheckUtils]: 12: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3187#(forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:00,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {3120#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) (_ bv1 1))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3124#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:00,992 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3113#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {3086#true} #236#return; {3120#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {3113#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {3113#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3113#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {3086#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; {3100#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:00,995 INFO L272 TraceCheckUtils]: 2: Hoare triple {3086#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {3086#true} is VALID [2022-02-20 23:59:00,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {3086#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {3086#true} is VALID [2022-02-20 23:59:00,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {3086#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); {3086#true} is VALID [2022-02-20 23:59:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:00,995 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:00,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429084438] [2022-02-20 23:59:00,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429084438] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:00,996 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:59:00,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-02-20 23:59:00,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892766061] [2022-02-20 23:59:01,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:01,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 23:59:01,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:01,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:59:01,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:01,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:59:01,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:59:01,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:59:01,041 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:59:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:02,569 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-02-20 23:59:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:59:02,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 23:59:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:59:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-02-20 23:59:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:59:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-02-20 23:59:02,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 144 transitions. [2022-02-20 23:59:02,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:02,698 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:59:02,698 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 23:59:02,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:59:02,698 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 4 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:02,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 645 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 303 Invalid, 0 Unknown, 72 Unchecked, 0.4s Time] [2022-02-20 23:59:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 23:59:02,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-02-20 23:59:02,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:02,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 127 states have internal predecessors, (138), 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:02,706 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 127 states have internal predecessors, (138), 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:02,706 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 127 states have internal predecessors, (138), 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:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:02,708 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-02-20 23:59:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-02-20 23:59:02,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:02,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:02,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 127 states have internal predecessors, (138), 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 132 states. [2022-02-20 23:59:02,709 INFO L87 Difference]: Start difference. First operand has 132 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 127 states have internal predecessors, (138), 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 132 states. [2022-02-20 23:59:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:02,711 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-02-20 23:59:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-02-20 23:59:02,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:02,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:02,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:02,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 127 states have internal predecessors, (138), 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:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-02-20 23:59:02,714 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 25 [2022-02-20 23:59:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:02,715 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-02-20 23:59:02,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:59:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-02-20 23:59:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:59:02,715 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:02,716 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:02,725 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-20 23:59:02,923 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-20 23:59:02,923 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:59:02,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216454, now seen corresponding path program 1 times [2022-02-20 23:59:02,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:02,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221185374] [2022-02-20 23:59:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:02,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:02,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:02,926 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-20 23:59:02,927 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-20 23:59:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:03,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:59:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:03,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:03,058 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:03,061 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:03,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:03,374 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-20 23:59:03,381 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:59:03,381 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-20 23:59:03,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {3773#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); {3773#true} is VALID [2022-02-20 23:59:03,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {3773#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {3773#true} is VALID [2022-02-20 23:59:03,424 INFO L272 TraceCheckUtils]: 2: Hoare triple {3773#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {3773#true} is VALID [2022-02-20 23:59:03,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {3773#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; {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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:03,426 INFO L290 TraceCheckUtils]: 4: Hoare triple {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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); {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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:03,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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:03,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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:03,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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; {3800#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:03,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {3800#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {3800#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:03,429 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3800#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {3773#true} #236#return; {3807#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset|))} is VALID [2022-02-20 23:59:03,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {3807#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset|))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3811#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:03,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {3811#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {3811#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:03,431 INFO L272 TraceCheckUtils]: 12: Hoare triple {3811#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3818#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:59:03,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {3818#(and (= |old(#valid)| |#valid|) (= |#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; {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} is VALID [2022-02-20 23:59:03,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} is VALID [2022-02-20 23:59:03,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} is VALID [2022-02-20 23:59:03,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} is VALID [2022-02-20 23:59:03,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} is VALID [2022-02-20 23:59:03,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} assume true; {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} is VALID [2022-02-20 23:59:03,437 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} {3811#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} #238#return; {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:03,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:03,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:03,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:03,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:03,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, sll_circular_create_~last~0#1.offset), #length[sll_circular_create_~last~0#1.base]) && ~bvule32(sll_circular_create_~last~0#1.offset, ~bvadd32(4bv32, sll_circular_create_~last~0#1.offset))) && ~bvule32(0bv32, sll_circular_create_~last~0#1.offset)); {3774#false} is VALID [2022-02-20 23:59:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:03,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:05,811 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:05,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221185374] [2022-02-20 23:59:05,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221185374] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:05,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1684027546] [2022-02-20 23:59:05,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:05,811 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:59:05,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:59:05,843 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-20 23:59:05,844 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-20 23:59:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:06,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:59:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:06,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:06,092 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:06,097 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:06,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:06,339 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-20 23:59:06,347 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:59:06,348 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-20 23:59:06,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {3773#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); {3773#true} is VALID [2022-02-20 23:59:06,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {3773#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {3773#true} is VALID [2022-02-20 23:59:06,384 INFO L272 TraceCheckUtils]: 2: Hoare triple {3773#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {3773#true} is VALID [2022-02-20 23:59:06,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {3773#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; {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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:06,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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); {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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:06,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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:06,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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:06,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {3787#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |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; {3800#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:06,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {3800#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {3800#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:06,388 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3800#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {3773#true} #236#return; {3807#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset|))} is VALID [2022-02-20 23:59:06,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {3807#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset|))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3811#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:06,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {3811#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {3811#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:06,390 INFO L272 TraceCheckUtils]: 12: Hoare triple {3811#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3818#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:59:06,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {3818#(and (= |old(#valid)| |#valid|) (= |#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; {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} is VALID [2022-02-20 23:59:06,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} is VALID [2022-02-20 23:59:06,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} is VALID [2022-02-20 23:59:06,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} is VALID [2022-02-20 23:59:06,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} is VALID [2022-02-20 23:59:06,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} assume true; {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} is VALID [2022-02-20 23:59:06,399 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_169 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_169)))))} {3811#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} #238#return; {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:06,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:06,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:06,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:06,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:06,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {3841#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, sll_circular_create_~last~0#1.offset), #length[sll_circular_create_~last~0#1.base]) && ~bvule32(sll_circular_create_~last~0#1.offset, ~bvadd32(4bv32, sll_circular_create_~last~0#1.offset))) && ~bvule32(0bv32, sll_circular_create_~last~0#1.offset)); {3774#false} is VALID [2022-02-20 23:59:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:06,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:06,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1684027546] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:06,617 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:59:06,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-02-20 23:59:06,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641542916] [2022-02-20 23:59:06,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-20 23:59:06,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:06,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:06,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:06,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:59:06,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:06,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:59:06,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2022-02-20 23:59:06,647 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:09,364 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2022-02-20 23:59:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:59:09,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-20 23:59:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2022-02-20 23:59:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2022-02-20 23:59:09,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 159 transitions. [2022-02-20 23:59:09,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:09,549 INFO L225 Difference]: With dead ends: 142 [2022-02-20 23:59:09,550 INFO L226 Difference]: Without dead ends: 142 [2022-02-20 23:59:09,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2022-02-20 23:59:09,550 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 4 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:09,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 553 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 474 Invalid, 0 Unknown, 83 Unchecked, 0.9s Time] [2022-02-20 23:59:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-02-20 23:59:09,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2022-02-20 23:59:09,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:09,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 138 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 132 states have internal predecessors, (144), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:59:09,553 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 138 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 132 states have internal predecessors, (144), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:59:09,553 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 138 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 132 states have internal predecessors, (144), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:59:09,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:09,557 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2022-02-20 23:59:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2022-02-20 23:59:09,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:09,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:09,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 132 states have internal predecessors, (144), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 142 states. [2022-02-20 23:59:09,559 INFO L87 Difference]: Start difference. First operand has 138 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 132 states have internal predecessors, (144), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 142 states. [2022-02-20 23:59:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:09,562 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2022-02-20 23:59:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2022-02-20 23:59:09,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:09,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:09,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:09,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 132 states have internal predecessors, (144), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:59:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2022-02-20 23:59:09,566 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 25 [2022-02-20 23:59:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:09,566 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2022-02-20 23:59:09,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2022-02-20 23:59:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 23:59:09,567 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:09,567 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:09,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:09,777 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-20 23:59:09,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:09,977 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:59:09,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:09,977 INFO L85 PathProgramCache]: Analyzing trace with hash -148939745, now seen corresponding path program 1 times [2022-02-20 23:59:09,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:09,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612865064] [2022-02-20 23:59:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:09,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:09,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:09,980 INFO L229 MonitoredProcess]: Starting monitored process 10 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:09,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:59:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:10,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:59:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:10,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:10,180 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:10,203 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:10,345 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:59:10,345 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-20 23:59:10,387 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:10,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:10,486 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-20 23:59:10,759 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:59:10,759 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-20 23:59:10,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {4534#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); {4534#true} is VALID [2022-02-20 23:59:10,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {4534#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4542#(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-20 23:59:10,800 INFO L272 TraceCheckUtils]: 2: Hoare triple {4542#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4546#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {4546#(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; {4550#(and (exists ((v_ArrVal_272 (_ 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_272) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,801 INFO L290 TraceCheckUtils]: 4: Hoare triple {4550#(and (exists ((v_ArrVal_272 (_ 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_272) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4550#(and (exists ((v_ArrVal_272 (_ 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_272) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {4550#(and (exists ((v_ArrVal_272 (_ 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_272) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {4550#(and (exists ((v_ArrVal_272 (_ 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_272) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {4550#(and (exists ((v_ArrVal_272 (_ 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_272) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {4550#(and (exists ((v_ArrVal_272 (_ 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_272) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {4550#(and (exists ((v_ArrVal_272 (_ 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_272) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4550#(and (exists ((v_ArrVal_272 (_ 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_272) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {4550#(and (exists ((v_ArrVal_272 (_ 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_272) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {4550#(and (exists ((v_ArrVal_272 (_ 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_272) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,807 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4550#(and (exists ((v_ArrVal_272 (_ 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_272) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {4542#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} #236#return; {4542#(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-20 23:59:10,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {4542#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4542#(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-20 23:59:10,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {4542#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {4542#(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-20 23:59:10,808 INFO L272 TraceCheckUtils]: 12: Hoare triple {4542#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {4546#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {4546#(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; {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (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; {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:10,819 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {4542#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} #238#return; {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:59:10,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:59:10,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:59:10,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:59:10,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:59:10,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4bv32); srcloc: L586-3 {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:59:10,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:59:10,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {4600#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_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_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {4622#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:10,826 INFO L272 TraceCheckUtils]: 27: Hoare triple {4622#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {4626#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:59:10,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {4626#(= |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; {4630#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:10,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {4630#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4630#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:10,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {4630#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {4630#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:10,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {4630#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {4630#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:10,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {4630#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4630#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:10,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {4630#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} assume true; {4630#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:10,836 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4630#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} {4622#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} #240#return; {4622#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:10,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {4622#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {4622#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:10,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {4622#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[sll_circular_insert_~head#1.base]); {4535#false} is VALID [2022-02-20 23:59:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:10,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:11,095 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:11,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612865064] [2022-02-20 23:59:11,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612865064] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:11,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1976540604] [2022-02-20 23:59:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:11,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:59:11,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:59:11,097 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:59:11,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-02-20 23:59:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:11,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:59:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:11,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:11,377 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:59:11,377 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-20 23:59:11,416 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 23:59:11,416 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 13 treesize of output 9 [2022-02-20 23:59:11,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:11,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:11,535 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:59:11,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 31 [2022-02-20 23:59:11,641 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 23:59:11,641 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 22 treesize of output 18 [2022-02-20 23:59:11,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:11,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:11,791 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:59:11,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2022-02-20 23:59:12,041 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 23:59:12,041 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 22 treesize of output 18 [2022-02-20 23:59:12,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:12,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:12,212 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:59:12,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2022-02-20 23:59:12,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {4534#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); {4713#(= (_ bv1 1) (select |#valid| (_ bv1 32)))} is VALID [2022-02-20 23:59:12,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {4713#(= (_ bv1 1) (select |#valid| (_ bv1 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4717#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))))} is VALID [2022-02-20 23:59:12,420 INFO L272 TraceCheckUtils]: 2: Hoare triple {4717#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4546#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {4546#(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; {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (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; {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,432 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {4717#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))))} #236#return; {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:12,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:12,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:12,435 INFO L272 TraceCheckUtils]: 12: Hoare triple {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {4752#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {4752#(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; {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (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; {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,451 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} #238#return; {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:12,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:12,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:12,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:12,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:12,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4bv32); srcloc: L586-3 {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:12,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:12,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {4742#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_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_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {4795#(and (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:12,474 INFO L272 TraceCheckUtils]: 27: Hoare triple {4795#(and (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {4752#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {4752#(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; {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (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; {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:12,492 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4581#(and (exists ((v_ArrVal_273 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_273) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {4795#(and (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} #240#return; {4820#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (or (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (_ bv1 32)))) (_ bv1 1))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:12,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {4820#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (or (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (_ bv1 32)))) (_ bv1 1))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {4820#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (or (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (_ bv1 32)))) (_ bv1 1))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:12,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {4820#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (or (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (_ bv1 32)))) (_ bv1 1))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[sll_circular_insert_~head#1.base]); {4535#false} is VALID [2022-02-20 23:59:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 23:59:12,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:12,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1976540604] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:12,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:59:12,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-02-20 23:59:12,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588165890] [2022-02-20 23:59:12,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:12,495 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-02-20 23:59:12,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:12,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:12,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:12,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:59:12,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:12,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:59:12,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:59:12,552 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:13,659 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2022-02-20 23:59:13,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:59:13,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-02-20 23:59:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2022-02-20 23:59:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2022-02-20 23:59:13,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 146 transitions. [2022-02-20 23:59:13,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:13,816 INFO L225 Difference]: With dead ends: 140 [2022-02-20 23:59:13,816 INFO L226 Difference]: Without dead ends: 140 [2022-02-20 23:59:13,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:59:13,817 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:13,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 484 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 133 Unchecked, 0.2s Time] [2022-02-20 23:59:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-02-20 23:59:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2022-02-20 23:59:13,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:13,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 137 states, 78 states have (on average 1.8333333333333333) internal successors, (143), 131 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:59:13,819 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 137 states, 78 states have (on average 1.8333333333333333) internal successors, (143), 131 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:59:13,820 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 137 states, 78 states have (on average 1.8333333333333333) internal successors, (143), 131 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:59:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:13,822 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2022-02-20 23:59:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2022-02-20 23:59:13,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:13,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:13,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 78 states have (on average 1.8333333333333333) internal successors, (143), 131 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 140 states. [2022-02-20 23:59:13,823 INFO L87 Difference]: Start difference. First operand has 137 states, 78 states have (on average 1.8333333333333333) internal successors, (143), 131 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 140 states. [2022-02-20 23:59:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:13,825 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2022-02-20 23:59:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2022-02-20 23:59:13,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:13,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:13,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:13,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 78 states have (on average 1.8333333333333333) internal successors, (143), 131 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:59:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2022-02-20 23:59:13,828 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 37 [2022-02-20 23:59:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:13,828 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2022-02-20 23:59:13,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2022-02-20 23:59:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 23:59:13,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:13,829 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:13,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:14,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:14,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:14,236 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:59:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash -148939744, now seen corresponding path program 1 times [2022-02-20 23:59:14,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:14,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235103502] [2022-02-20 23:59:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:14,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:14,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:14,238 INFO L229 MonitoredProcess]: Starting monitored process 12 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:14,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:59:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:14,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:59:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:14,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:14,420 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:14,425 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:14,451 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:14,456 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:16,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:16,592 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-20 23:59:16,601 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:59:16,601 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-20 23:59:16,660 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:18,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:18,800 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-20 23:59:19,161 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:59:19,161 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:19,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {5389#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); {5389#true} is VALID [2022-02-20 23:59:19,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {5389#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {5397#(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-20 23:59:19,240 INFO L272 TraceCheckUtils]: 2: Hoare triple {5397#(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_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {5401#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:19,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {5401#(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; {5405#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_397 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_397)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:59:19,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {5405#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_397 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_397)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5405#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_397 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_397)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:59:19,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {5405#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_397 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_397)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {5405#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_397 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_397)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:59:19,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {5405#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_397 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_397)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {5405#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_397 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_397)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:59:19,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {5405#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_397 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_397)) (= (_ 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; {5405#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_397 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_397)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:59:19,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {5405#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_397 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_397)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} assume true; {5405#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_397 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_397)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:59:19,247 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5405#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_397 (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_397)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} {5397#(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|)))} #236#return; {5424#(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-20 23:59:19,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {5424#(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_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5424#(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-20 23:59:19,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {5424#(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_circular_create_~len#1, 1bv32); {5424#(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-20 23:59:19,249 INFO L272 TraceCheckUtils]: 12: Hoare triple {5424#(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_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5434#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:19,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {5434#(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; {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:19,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:19,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:19,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:19,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (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; {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:19,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:19,260 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {5424#(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|)))} #238#return; {5457#(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-20 23:59:19,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {5457#(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_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {5457#(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-20 23:59:19,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {5457#(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_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {5457#(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-20 23:59:19,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {5457#(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_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {5457#(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-20 23:59:19,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {5457#(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_circular_create_~len#1, 1bv32); {5457#(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-20 23:59:19,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {5457#(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_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4bv32); srcloc: L586-3 {5457#(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-20 23:59:19,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {5457#(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_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5457#(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-20 23:59:19,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {5457#(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~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_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_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {5479#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)))} is VALID [2022-02-20 23:59:19,264 INFO L272 TraceCheckUtils]: 27: Hoare triple {5479#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {5483#(= |#length| |old(#length)|)} is VALID [2022-02-20 23:59:19,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {5483#(= |#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; {5487#(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-20 23:59:19,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {5487#(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); {5487#(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-20 23:59:19,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {5487#(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, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {5487#(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-20 23:59:19,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {5487#(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, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {5487#(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-20 23:59:19,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {5487#(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; {5487#(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-20 23:59:19,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {5487#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} assume true; {5487#(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-20 23:59:19,268 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5487#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} {5479#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)))} #240#return; {5506#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |node_create_~temp~0#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|))) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:59:19,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {5506#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |node_create_~temp~0#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|))) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {5506#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |node_create_~temp~0#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|))) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:59:19,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {5506#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |node_create_~temp~0#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|))) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))))} assume !((~bvule32(~bvadd32(4bv32, sll_circular_insert_~head#1.offset), #length[sll_circular_insert_~head#1.base]) && ~bvule32(sll_circular_insert_~head#1.offset, ~bvadd32(4bv32, sll_circular_insert_~head#1.offset))) && ~bvule32(0bv32, sll_circular_insert_~head#1.offset)); {5390#false} is VALID [2022-02-20 23:59:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:19,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:19,476 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:19,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235103502] [2022-02-20 23:59:19,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235103502] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:19,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1708444977] [2022-02-20 23:59:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:19,477 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:59:19,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:59:19,478 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:59:19,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-02-20 23:59:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:19,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:59:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:19,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:19,762 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:19,774 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:19,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:19,891 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-20 23:59:19,969 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:22,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:22,117 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-20 23:59:22,277 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:22,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:22,461 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-20 23:59:22,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {5389#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); {5389#true} is VALID [2022-02-20 23:59:22,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {5389#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {5424#(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-20 23:59:22,518 INFO L272 TraceCheckUtils]: 2: Hoare triple {5424#(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_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {5434#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {5434#(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; {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,519 INFO L290 TraceCheckUtils]: 4: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (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; {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,531 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {5424#(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|)))} #236#return; {5551#(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-20 23:59:22,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {5551#(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_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5551#(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-20 23:59:22,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {5551#(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_circular_create_~len#1, 1bv32); {5551#(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-20 23:59:22,532 INFO L272 TraceCheckUtils]: 12: Hoare triple {5551#(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_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5561#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {5561#(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; {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (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; {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,545 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {5551#(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|)))} #238#return; {5551#(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-20 23:59:22,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {5551#(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_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {5551#(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-20 23:59:22,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {5551#(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_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {5551#(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-20 23:59:22,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {5551#(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_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {5551#(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-20 23:59:22,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {5551#(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_circular_create_~len#1, 1bv32); {5551#(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-20 23:59:22,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {5551#(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_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4bv32); srcloc: L586-3 {5551#(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-20 23:59:22,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {5551#(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_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5551#(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-20 23:59:22,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {5551#(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~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_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_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {5604#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} is VALID [2022-02-20 23:59:22,550 INFO L272 TraceCheckUtils]: 27: Hoare triple {5604#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {5561#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {5561#(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; {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (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; {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:22,565 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5438#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (and (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_398) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {5604#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))))} #240#return; {5479#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)))} is VALID [2022-02-20 23:59:22,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {5479#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {5479#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)))} is VALID [2022-02-20 23:59:22,566 INFO L290 TraceCheckUtils]: 36: Hoare triple {5479#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, sll_circular_insert_~head#1.offset), #length[sll_circular_insert_~head#1.base]) && ~bvule32(sll_circular_insert_~head#1.offset, ~bvadd32(4bv32, sll_circular_insert_~head#1.offset))) && ~bvule32(0bv32, sll_circular_insert_~head#1.offset)); {5390#false} is VALID [2022-02-20 23:59:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 23:59:22,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:22,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1708444977] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:22,567 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:59:22,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2022-02-20 23:59:22,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996066831] [2022-02-20 23:59:22,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:22,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-02-20 23:59:22,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:22,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:22,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:22,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:59:22,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:22,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:59:22,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=253, Unknown=3, NotChecked=0, Total=306 [2022-02-20 23:59:22,630 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:23,929 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2022-02-20 23:59:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:59:23,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-02-20 23:59:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2022-02-20 23:59:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2022-02-20 23:59:23,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 143 transitions. [2022-02-20 23:59:24,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:24,064 INFO L225 Difference]: With dead ends: 137 [2022-02-20 23:59:24,064 INFO L226 Difference]: Without dead ends: 137 [2022-02-20 23:59:24,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=59, Invalid=280, Unknown=3, NotChecked=0, Total=342 [2022-02-20 23:59:24,065 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 12 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:24,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 496 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 122 Unchecked, 0.4s Time] [2022-02-20 23:59:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-20 23:59:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2022-02-20 23:59:24,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:24,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 136 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 130 states have internal predecessors, (142), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:59:24,068 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 136 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 130 states have internal predecessors, (142), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:59:24,068 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 136 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 130 states have internal predecessors, (142), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:59:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:24,069 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2022-02-20 23:59:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2022-02-20 23:59:24,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:24,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:24,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 130 states have internal predecessors, (142), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 137 states. [2022-02-20 23:59:24,070 INFO L87 Difference]: Start difference. First operand has 136 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 130 states have internal predecessors, (142), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 137 states. [2022-02-20 23:59:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:24,089 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2022-02-20 23:59:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2022-02-20 23:59:24,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:24,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:24,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:24,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 130 states have internal predecessors, (142), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:59:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2022-02-20 23:59:24,091 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 37 [2022-02-20 23:59:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:24,091 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2022-02-20 23:59:24,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2022-02-20 23:59:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 23:59:24,094 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:24,094 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:24,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:24,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:24,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:24,498 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:59:24,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:24,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1941562572, now seen corresponding path program 2 times [2022-02-20 23:59:24,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:24,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034516790] [2022-02-20 23:59:24,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:59:24,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:24,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:24,500 INFO L229 MonitoredProcess]: Starting monitored process 14 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:24,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:59:24,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:59:24,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:59:24,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:59:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:24,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:24,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {6183#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); {6183#true} is VALID [2022-02-20 23:59:24,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {6183#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} is VALID [2022-02-20 23:59:24,715 INFO L272 TraceCheckUtils]: 2: Hoare triple {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {6183#true} is VALID [2022-02-20 23:59:24,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {6183#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; {6183#true} is VALID [2022-02-20 23:59:24,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {6183#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6183#true} is VALID [2022-02-20 23:59:24,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {6183#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {6183#true} is VALID [2022-02-20 23:59:24,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {6183#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {6183#true} is VALID [2022-02-20 23:59:24,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {6183#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6183#true} is VALID [2022-02-20 23:59:24,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {6183#true} assume true; {6183#true} is VALID [2022-02-20 23:59:24,716 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6183#true} {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} #236#return; {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} is VALID [2022-02-20 23:59:24,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} is VALID [2022-02-20 23:59:24,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} is VALID [2022-02-20 23:59:24,717 INFO L272 TraceCheckUtils]: 12: Hoare triple {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {6183#true} is VALID [2022-02-20 23:59:24,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {6183#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; {6183#true} is VALID [2022-02-20 23:59:24,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {6183#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6183#true} is VALID [2022-02-20 23:59:24,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {6183#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {6183#true} is VALID [2022-02-20 23:59:24,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {6183#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {6183#true} is VALID [2022-02-20 23:59:24,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {6183#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6183#true} is VALID [2022-02-20 23:59:24,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {6183#true} assume true; {6183#true} is VALID [2022-02-20 23:59:24,718 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6183#true} {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} #238#return; {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} is VALID [2022-02-20 23:59:24,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} is VALID [2022-02-20 23:59:24,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} is VALID [2022-02-20 23:59:24,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {6191#(= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {6255#(= (_ bv2 32) (bvadd |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32)))} is VALID [2022-02-20 23:59:24,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {6255#(= (_ bv2 32) (bvadd |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32)))} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {6184#false} is VALID [2022-02-20 23:59:24,720 INFO L272 TraceCheckUtils]: 24: Hoare triple {6184#false} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {6184#false} is VALID [2022-02-20 23:59:24,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {6184#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; {6184#false} is VALID [2022-02-20 23:59:24,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {6184#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6184#false} is VALID [2022-02-20 23:59:24,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {6184#false} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {6184#false} is VALID [2022-02-20 23:59:24,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {6184#false} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {6184#false} is VALID [2022-02-20 23:59:24,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {6184#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6184#false} is VALID [2022-02-20 23:59:24,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {6184#false} assume true; {6184#false} is VALID [2022-02-20 23:59:24,720 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6184#false} {6184#false} #238#return; {6184#false} is VALID [2022-02-20 23:59:24,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {6184#false} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {6184#false} is VALID [2022-02-20 23:59:24,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {6184#false} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {6184#false} is VALID [2022-02-20 23:59:24,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {6184#false} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {6184#false} is VALID [2022-02-20 23:59:24,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {6184#false} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {6184#false} is VALID [2022-02-20 23:59:24,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {6184#false} assume !((~bvule32(~bvadd32(4bv32, sll_circular_create_~last~0#1.offset), #length[sll_circular_create_~last~0#1.base]) && ~bvule32(sll_circular_create_~last~0#1.offset, ~bvadd32(4bv32, sll_circular_create_~last~0#1.offset))) && ~bvule32(0bv32, sll_circular_create_~last~0#1.offset)); {6184#false} is VALID [2022-02-20 23:59:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:59:24,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:24,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {6184#false} assume !((~bvule32(~bvadd32(4bv32, sll_circular_create_~last~0#1.offset), #length[sll_circular_create_~last~0#1.base]) && ~bvule32(sll_circular_create_~last~0#1.offset, ~bvadd32(4bv32, sll_circular_create_~last~0#1.offset))) && ~bvule32(0bv32, sll_circular_create_~last~0#1.offset)); {6184#false} is VALID [2022-02-20 23:59:24,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {6184#false} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {6184#false} is VALID [2022-02-20 23:59:24,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {6184#false} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {6184#false} is VALID [2022-02-20 23:59:24,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {6184#false} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {6184#false} is VALID [2022-02-20 23:59:24,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {6184#false} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {6184#false} is VALID [2022-02-20 23:59:24,828 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6183#true} {6184#false} #238#return; {6184#false} is VALID [2022-02-20 23:59:24,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {6183#true} assume true; {6183#true} is VALID [2022-02-20 23:59:24,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {6183#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6183#true} is VALID [2022-02-20 23:59:24,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {6183#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {6183#true} is VALID [2022-02-20 23:59:24,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {6183#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {6183#true} is VALID [2022-02-20 23:59:24,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {6183#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6183#true} is VALID [2022-02-20 23:59:24,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {6183#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; {6183#true} is VALID [2022-02-20 23:59:24,828 INFO L272 TraceCheckUtils]: 24: Hoare triple {6184#false} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {6183#true} is VALID [2022-02-20 23:59:24,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {6337#(not (bvsgt |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32)))} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {6184#false} is VALID [2022-02-20 23:59:24,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {6337#(not (bvsgt |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32)))} is VALID [2022-02-20 23:59:24,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} is VALID [2022-02-20 23:59:24,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} is VALID [2022-02-20 23:59:24,831 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6183#true} {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} #238#return; {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} is VALID [2022-02-20 23:59:24,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {6183#true} assume true; {6183#true} is VALID [2022-02-20 23:59:24,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {6183#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6183#true} is VALID [2022-02-20 23:59:24,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {6183#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {6183#true} is VALID [2022-02-20 23:59:24,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {6183#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {6183#true} is VALID [2022-02-20 23:59:24,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {6183#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6183#true} is VALID [2022-02-20 23:59:24,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {6183#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; {6183#true} is VALID [2022-02-20 23:59:24,832 INFO L272 TraceCheckUtils]: 12: Hoare triple {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {6183#true} is VALID [2022-02-20 23:59:24,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} is VALID [2022-02-20 23:59:24,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} is VALID [2022-02-20 23:59:24,837 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6183#true} {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} #236#return; {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} is VALID [2022-02-20 23:59:24,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {6183#true} assume true; {6183#true} is VALID [2022-02-20 23:59:24,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {6183#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6183#true} is VALID [2022-02-20 23:59:24,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {6183#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {6183#true} is VALID [2022-02-20 23:59:24,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {6183#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {6183#true} is VALID [2022-02-20 23:59:24,838 INFO L290 TraceCheckUtils]: 4: Hoare triple {6183#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6183#true} is VALID [2022-02-20 23:59:24,838 INFO L290 TraceCheckUtils]: 3: Hoare triple {6183#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; {6183#true} is VALID [2022-02-20 23:59:24,838 INFO L272 TraceCheckUtils]: 2: Hoare triple {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {6183#true} is VALID [2022-02-20 23:59:24,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {6183#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {6341#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_circular_create_~len#1|) (_ bv1 32)))} is VALID [2022-02-20 23:59:24,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {6183#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); {6183#true} is VALID [2022-02-20 23:59:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 23:59:24,839 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:24,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034516790] [2022-02-20 23:59:24,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034516790] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:24,839 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:59:24,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-02-20 23:59:24,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680787674] [2022-02-20 23:59:24,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:24,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-02-20 23:59:24,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:24,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:59:24,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:24,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:59:24,871 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:24,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:59:24,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:24,872 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:59:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:25,445 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2022-02-20 23:59:25,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:59:25,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-02-20 23:59:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:59:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-02-20 23:59:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:59:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-02-20 23:59:25,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-02-20 23:59:25,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:25,601 INFO L225 Difference]: With dead ends: 129 [2022-02-20 23:59:25,602 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 23:59:25,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:25,602 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 121 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:25,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 303 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 23:59:25,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-02-20 23:59:25,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:25,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 124 states have internal predecessors, (134), 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:25,605 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 124 states have internal predecessors, (134), 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:25,605 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 124 states have internal predecessors, (134), 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:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:25,606 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2022-02-20 23:59:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-02-20 23:59:25,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:25,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:25,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 124 states have internal predecessors, (134), 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 129 states. [2022-02-20 23:59:25,607 INFO L87 Difference]: Start difference. First operand has 129 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 124 states have internal predecessors, (134), 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 129 states. [2022-02-20 23:59:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:25,609 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2022-02-20 23:59:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-02-20 23:59:25,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:25,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:25,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:25,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 124 states have internal predecessors, (134), 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:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2022-02-20 23:59:25,612 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 37 [2022-02-20 23:59:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:25,612 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2022-02-20 23:59:25,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:59:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-02-20 23:59:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 23:59:25,613 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:25,613 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:25,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:25,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:25,814 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:59:25,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:25,814 INFO L85 PathProgramCache]: Analyzing trace with hash -362722266, now seen corresponding path program 1 times [2022-02-20 23:59:25,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:25,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151703562] [2022-02-20 23:59:25,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:25,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:25,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:25,824 INFO L229 MonitoredProcess]: Starting monitored process 15 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:25,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:59:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:26,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:59:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:26,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:26,129 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:26,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 12 treesize of output 8 [2022-02-20 23:59:26,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:26,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 21 [2022-02-20 23:59:26,840 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-02-20 23:59:26,840 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 24 treesize of output 35 [2022-02-20 23:59:27,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2022-02-20 23:59:27,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {6923#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); {6923#true} is VALID [2022-02-20 23:59:27,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {6923#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {6931#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:27,273 INFO L272 TraceCheckUtils]: 2: Hoare triple {6931#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:27,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {6935#(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; {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:27,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:27,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:27,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:27,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:27,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:27,276 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {6931#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #236#return; {6931#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:27,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {6931#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {6931#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:27,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {6931#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {6931#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:27,277 INFO L272 TraceCheckUtils]: 12: Hoare triple {6931#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:27,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {6935#(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; {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:27,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:27,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:27,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:27,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6982#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:27,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {6982#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {6982#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:27,281 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6982#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {6931#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #238#return; {6989#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:27,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {6989#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (_ bv1 1)) (_ bv0 1)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {6993#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:27,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {6993#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {6993#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:27,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {6993#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {7000#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:27,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {7000#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {7000#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:27,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {7000#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4bv32); srcloc: L586-3 {7000#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:27,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {7000#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {7010#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:27,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {7010#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (_ bv1 1)) (_ bv0 1)))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_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_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {7014#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (_ bv1 1))) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|))} is VALID [2022-02-20 23:59:27,286 INFO L272 TraceCheckUtils]: 27: Hoare triple {7014#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (_ bv1 1))) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {7018#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:59:27,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {7018#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~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; {7022#(and (exists ((v_ArrVal_574 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:59:27,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {7022#(and (exists ((v_ArrVal_574 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {7022#(and (exists ((v_ArrVal_574 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:59:27,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {7022#(and (exists ((v_ArrVal_574 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {7029#(and (exists ((v_ArrVal_574 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_575) |#memory_$Pointer$.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:27,305 WARN L290 TraceCheckUtils]: 31: Hoare triple {7029#(and (exists ((v_ArrVal_574 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_575) |#memory_$Pointer$.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {7033#(and (exists ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_576) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is UNKNOWN [2022-02-20 23:59:27,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {7033#(and (exists ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_576) |#memory_$Pointer$.base|) (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; {7033#(and (exists ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_576) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:27,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {7033#(and (exists ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_576) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {7033#(and (exists ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_576) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:27,324 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7033#(and (exists ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_576) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {7014#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (_ bv1 1))) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|))} #240#return; {7043#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (exists ((v_arrayElimCell_45 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (bvneg v_arrayElimCell_45))) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_45) (_ bv1 1))))))} is VALID [2022-02-20 23:59:27,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {7043#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (exists ((v_arrayElimCell_45 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (bvneg v_arrayElimCell_45))) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_45) (_ bv1 1))))))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {7043#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (exists ((v_arrayElimCell_45 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (bvneg v_arrayElimCell_45))) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_45) (_ bv1 1))))))} is VALID [2022-02-20 23:59:27,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {7043#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (exists ((v_arrayElimCell_45 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (bvneg v_arrayElimCell_45))) (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_45) (_ bv1 1))))))} SUMMARY for call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4bv32); srcloc: L609 {7050#(exists ((v_arrayElimCell_45 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_45) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) (bvneg v_arrayElimCell_45)))))} is VALID [2022-02-20 23:59:27,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {7050#(exists ((v_arrayElimCell_45 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_45) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) (bvneg v_arrayElimCell_45)))))} sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {7054#(exists ((v_arrayElimCell_45 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_45) (_ bv1 1))) (= (bvadd (bvneg v_arrayElimCell_45) (select |#valid| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:59:27,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {7054#(exists ((v_arrayElimCell_45 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_45) (_ bv1 1))) (= (bvadd (bvneg v_arrayElimCell_45) (select |#valid| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (_ bv0 1))))} assume !!~bvsgt32(sll_circular_insert_~index#1, 0bv32);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset; {7054#(exists ((v_arrayElimCell_45 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_45) (_ bv1 1))) (= (bvadd (bvneg v_arrayElimCell_45) (select |#valid| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:59:27,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {7054#(exists ((v_arrayElimCell_45 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg v_arrayElimCell_45) (_ bv1 1))) (= (bvadd (bvneg v_arrayElimCell_45) (select |#valid| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (_ bv0 1))))} assume !(1bv1 == #valid[sll_circular_insert_~last~1#1.base]); {6924#false} is VALID [2022-02-20 23:59:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:27,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:27,640 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:27,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151703562] [2022-02-20 23:59:27,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151703562] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:27,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [846181254] [2022-02-20 23:59:27,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:27,640 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:59:27,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:59:27,648 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:59:27,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-02-20 23:59:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:27,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:59:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:27,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:28,088 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:28,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 12 treesize of output 8 [2022-02-20 23:59:28,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:28,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 21 [2022-02-20 23:59:28,990 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-02-20 23:59:28,990 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 24 treesize of output 35 [2022-02-20 23:59:29,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-02-20 23:59:29,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {6923#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); {6923#true} is VALID [2022-02-20 23:59:29,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {6923#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {7086#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:59:29,352 INFO L272 TraceCheckUtils]: 2: Hoare triple {7086#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:29,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {6935#(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; {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:29,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:29,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:29,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:29,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:29,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:29,355 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {7086#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} #236#return; {7086#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:59:29,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {7086#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {7086#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:59:29,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {7086#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {7086#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:59:29,357 INFO L272 TraceCheckUtils]: 12: Hoare triple {7086#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {6935#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:29,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {6935#(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; {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:29,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:29,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:29,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:29,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {6969#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6982#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:29,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {6982#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {6982#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:29,361 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6982#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {7086#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} #238#return; {7141#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:29,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {7141#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (_ bv1 1)) (_ bv0 1)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {7145#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:29,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {7145#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {7145#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:29,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {7145#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {7152#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:29,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {7152#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {7152#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:29,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {7152#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4bv32); srcloc: L586-3 {7152#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:29,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {7152#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {7162#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:59:29,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {7162#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (_ bv1 1)) (_ bv0 1)))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_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_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {7166#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)))))))} is VALID [2022-02-20 23:59:29,365 INFO L272 TraceCheckUtils]: 27: Hoare triple {7166#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)))))))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {7018#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:59:29,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {7018#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~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; {7022#(and (exists ((v_ArrVal_574 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:59:29,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {7022#(and (exists ((v_ArrVal_574 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {7022#(and (exists ((v_ArrVal_574 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:59:29,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {7022#(and (exists ((v_ArrVal_574 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {7029#(and (exists ((v_ArrVal_574 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_575) |#memory_$Pointer$.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:29,382 WARN L290 TraceCheckUtils]: 31: Hoare triple {7029#(and (exists ((v_ArrVal_574 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_575) |#memory_$Pointer$.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {7033#(and (exists ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_576) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is UNKNOWN [2022-02-20 23:59:29,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {7033#(and (exists ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_576) |#memory_$Pointer$.base|) (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; {7033#(and (exists ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_576) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:29,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {7033#(and (exists ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_576) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {7033#(and (exists ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_576) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:29,397 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7033#(and (exists ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_574) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_576) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {7166#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)))))))} #240#return; {7191#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32))))) (_ bv1 1))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:59:29,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {7191#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32))))) (_ bv1 1))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {7191#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32))))) (_ bv1 1))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:59:29,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {7191#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32))))) (_ bv1 1))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} SUMMARY for call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4bv32); srcloc: L609 {7068#(= (select |#valid| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:29,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {7068#(= (select |#valid| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) (_ bv1 1))} sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {7061#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))} is VALID [2022-02-20 23:59:29,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {7061#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))} assume !!~bvsgt32(sll_circular_insert_~index#1, 0bv32);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset; {7061#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))} is VALID [2022-02-20 23:59:29,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {7061#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))} assume !(1bv1 == #valid[sll_circular_insert_~last~1#1.base]); {6924#false} is VALID [2022-02-20 23:59:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:29,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:29,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [846181254] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:29,638 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:59:29,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2022-02-20 23:59:29,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140982448] [2022-02-20 23:59:29,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:29,639 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-02-20 23:59:29,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:29,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:59:29,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:29,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-20 23:59:29,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:29,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-20 23:59:29,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=704, Unknown=5, NotChecked=0, Total=812 [2022-02-20 23:59:29,808 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 27 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:59:33,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:33,904 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2022-02-20 23:59:33,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:59:33,904 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-02-20 23:59:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:59:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 252 transitions. [2022-02-20 23:59:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:59:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 252 transitions. [2022-02-20 23:59:33,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 252 transitions. [2022-02-20 23:59:34,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 251 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:34,249 INFO L225 Difference]: With dead ends: 230 [2022-02-20 23:59:34,249 INFO L226 Difference]: Without dead ends: 230 [2022-02-20 23:59:34,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=163, Invalid=1088, Unknown=9, NotChecked=0, Total=1260 [2022-02-20 23:59:34,249 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 130 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:34,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 559 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 459 Invalid, 0 Unknown, 171 Unchecked, 1.2s Time] [2022-02-20 23:59:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-02-20 23:59:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 131. [2022-02-20 23:59:34,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:34,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 131 states, 75 states have (on average 1.84) internal successors, (138), 126 states have internal predecessors, (138), 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:34,252 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 131 states, 75 states have (on average 1.84) internal successors, (138), 126 states have internal predecessors, (138), 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:34,252 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 131 states, 75 states have (on average 1.84) internal successors, (138), 126 states have internal predecessors, (138), 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:34,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:34,258 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2022-02-20 23:59:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 251 transitions. [2022-02-20 23:59:34,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:34,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:34,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 75 states have (on average 1.84) internal successors, (138), 126 states have internal predecessors, (138), 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 230 states. [2022-02-20 23:59:34,260 INFO L87 Difference]: Start difference. First operand has 131 states, 75 states have (on average 1.84) internal successors, (138), 126 states have internal predecessors, (138), 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 230 states. [2022-02-20 23:59:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:34,263 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2022-02-20 23:59:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 251 transitions. [2022-02-20 23:59:34,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:34,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:34,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:34,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 75 states have (on average 1.84) internal successors, (138), 126 states have internal predecessors, (138), 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:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2022-02-20 23:59:34,266 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 40 [2022-02-20 23:59:34,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:34,266 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2022-02-20 23:59:34,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:59:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2022-02-20 23:59:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 23:59:34,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:34,267 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:34,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:34,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:34,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:34,679 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:59:34,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash -362722265, now seen corresponding path program 1 times [2022-02-20 23:59:34,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:34,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62826746] [2022-02-20 23:59:34,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:34,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:34,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:34,681 INFO L229 MonitoredProcess]: Starting monitored process 17 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:34,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:59:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:34,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-20 23:59:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:34,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:34,995 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:35,004 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:35,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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:35,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 14 [2022-02-20 23:59:35,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 3 [2022-02-20 23:59:36,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:36,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 28 [2022-02-20 23:59:36,034 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 23:59:36,035 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 18 treesize of output 18 [2022-02-20 23:59:36,063 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 16 treesize of output 18 [2022-02-20 23:59:36,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:36,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 23:59:36,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 13 [2022-02-20 23:59:36,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-02-20 23:59:36,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {8061#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); {8061#true} is VALID [2022-02-20 23:59:36,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {8061#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {8069#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:36,523 INFO L272 TraceCheckUtils]: 2: Hoare triple {8069#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:36,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {8073#(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; {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:36,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:36,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:36,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:36,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:36,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:36,526 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {8069#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #236#return; {8069#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:36,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {8069#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {8069#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:36,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {8069#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {8069#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:36,527 INFO L272 TraceCheckUtils]: 12: Hoare triple {8069#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:36,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {8073#(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; {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:36,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:36,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:36,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:36,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8120#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:36,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {8120#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {8120#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:36,532 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8120#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {8069#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #238#return; {8127#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:59:36,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {8127#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (_ bv8 32)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {8131#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:59:36,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {8131#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (_ bv8 32)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {8131#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:59:36,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {8131#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (_ bv8 32)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {8138#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:59:36,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {8138#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {8138#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:59:36,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {8138#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4bv32); srcloc: L586-3 {8138#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:59:36,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {8138#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {8148#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_#res#1.offset|))} is VALID [2022-02-20 23:59:36,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {8148#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_#res#1.offset|))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_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_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {8152#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (_ bv1 1))) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:59:36,537 INFO L272 TraceCheckUtils]: 27: Hoare triple {8152#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (_ bv1 1))) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) (_ bv0 32)))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {8156#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:59:36,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {8156#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~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; {8160#(and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:59:36,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {8160#(and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8160#(and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:59:36,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {8160#(and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {8167#(and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_711) |#memory_$Pointer$.base|)) (exists ((v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_712) |#memory_$Pointer$.offset|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:36,573 WARN L290 TraceCheckUtils]: 31: Hoare triple {8167#(and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_711) |#memory_$Pointer$.base|)) (exists ((v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_712) |#memory_$Pointer$.offset|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {8171#(and (exists ((v_ArrVal_710 (_ BitVec 32)) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_713) |#memory_$Pointer$.offset|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is UNKNOWN [2022-02-20 23:59:36,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {8171#(and (exists ((v_ArrVal_710 (_ BitVec 32)) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_713) |#memory_$Pointer$.offset|) (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; {8171#(and (exists ((v_ArrVal_710 (_ BitVec 32)) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_713) |#memory_$Pointer$.offset|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:36,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {8171#(and (exists ((v_ArrVal_710 (_ BitVec 32)) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_713) |#memory_$Pointer$.offset|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {8171#(and (exists ((v_ArrVal_710 (_ BitVec 32)) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_713) |#memory_$Pointer$.offset|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:36,626 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8171#(and (exists ((v_ArrVal_710 (_ BitVec 32)) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_713) |#memory_$Pointer$.offset|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {8152#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (_ bv1 1))) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) (_ bv0 32)))} #240#return; {8181#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:59:36,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {8181#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) (_ bv0 32)))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {8181#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:59:36,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {8181#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) (_ bv0 32)))} SUMMARY for call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4bv32); srcloc: L609 {8188#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|)) (= |ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:59:36,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {8188#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|)) (= |ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| (_ bv0 32)))} sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {8192#(and (= (_ bv0 32) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)))} is VALID [2022-02-20 23:59:36,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {8192#(and (= (_ bv0 32) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)))} assume !!~bvsgt32(sll_circular_insert_~index#1, 0bv32);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset; {8192#(and (= (_ bv0 32) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)))} is VALID [2022-02-20 23:59:36,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {8192#(and (= (_ bv0 32) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, sll_circular_insert_~last~1#1.offset), #length[sll_circular_insert_~last~1#1.base]) && ~bvule32(sll_circular_insert_~last~1#1.offset, ~bvadd32(4bv32, sll_circular_insert_~last~1#1.offset))) && ~bvule32(0bv32, sll_circular_insert_~last~1#1.offset)); {8062#false} is VALID [2022-02-20 23:59:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:36,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:37,306 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:37,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62826746] [2022-02-20 23:59:37,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62826746] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:37,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [974125582] [2022-02-20 23:59:37,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:37,307 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:59:37,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:59:37,308 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:59:37,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-02-20 23:59:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:37,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-20 23:59:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:37,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:37,765 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:37,772 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:38,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 14 [2022-02-20 23:59:38,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 3 [2022-02-20 23:59:38,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:38,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-02-20 23:59:38,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:38,700 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 16 treesize of output 18 [2022-02-20 23:59:38,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:38,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 28 [2022-02-20 23:59:38,745 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 23:59:38,745 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 18 treesize of output 18 [2022-02-20 23:59:39,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 13 [2022-02-20 23:59:39,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-02-20 23:59:39,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {8061#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); {8061#true} is VALID [2022-02-20 23:59:39,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {8061#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~post24#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~post28#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem29#1.base, main_#t~mem29#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_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {8224#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:59:39,120 INFO L272 TraceCheckUtils]: 2: Hoare triple {8224#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:39,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {8073#(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; {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:39,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:39,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:39,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:39,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:39,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:39,123 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {8224#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} #236#return; {8224#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:59:39,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {8224#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {8224#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:59:39,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {8224#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} assume !!~bvsgt32(sll_circular_create_~len#1, 1bv32); {8224#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:59:39,124 INFO L272 TraceCheckUtils]: 12: Hoare triple {8224#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {8073#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:59:39,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {8073#(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; {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:39,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:39,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:39,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:39,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {8107#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8120#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:39,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {8120#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {8120#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:59:39,129 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8120#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {8224#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} #238#return; {8279#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:59:39,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {8279#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (_ bv8 32)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {8283#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:59:39,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {8283#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (_ bv8 32)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4bv32); srcloc: L588 {8283#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:59:39,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {8283#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (_ bv8 32)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := ~bvsub32(sll_circular_create_#t~post6#1, 1bv32);havoc sll_circular_create_#t~post6#1; {8290#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:59:39,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {8290#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))} assume !~bvsgt32(sll_circular_create_~len#1, 1bv32); {8290#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:59:39,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {8290#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4bv32); srcloc: L586-3 {8290#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:59:39,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {8290#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {8300#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_#res#1.offset|))} is VALID [2022-02-20 23:59:39,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {8300#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_#res#1.offset|))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_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_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {8304#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32))) (_ bv8 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)))))))} is VALID [2022-02-20 23:59:39,147 INFO L272 TraceCheckUtils]: 27: Hoare triple {8304#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32))) (_ bv8 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)))))))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {8156#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:59:39,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {8156#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~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; {8160#(and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:59:39,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {8160#(and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8160#(and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:59:39,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {8160#(and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L576-1 {8167#(and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_711) |#memory_$Pointer$.base|)) (exists ((v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_712) |#memory_$Pointer$.offset|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:39,212 WARN L290 TraceCheckUtils]: 31: Hoare triple {8167#(and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_711) |#memory_$Pointer$.base|)) (exists ((v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_712) |#memory_$Pointer$.offset|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L579 {8171#(and (exists ((v_ArrVal_710 (_ BitVec 32)) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_713) |#memory_$Pointer$.offset|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is UNKNOWN [2022-02-20 23:59:39,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {8171#(and (exists ((v_ArrVal_710 (_ BitVec 32)) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_713) |#memory_$Pointer$.offset|) (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; {8171#(and (exists ((v_ArrVal_710 (_ BitVec 32)) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_713) |#memory_$Pointer$.offset|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:39,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {8171#(and (exists ((v_ArrVal_710 (_ BitVec 32)) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_713) |#memory_$Pointer$.offset|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {8171#(and (exists ((v_ArrVal_710 (_ BitVec 32)) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_713) |#memory_$Pointer$.offset|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:39,239 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8171#(and (exists ((v_ArrVal_710 (_ BitVec 32)) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_710)) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_713) |#memory_$Pointer$.offset|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {8304#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32))) (_ bv8 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)))))))} #240#return; {8329#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32))) (_ bv8 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:59:39,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {8329#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32))) (_ bv8 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32; {8329#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32))) (_ bv8 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:59:39,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {8329#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32))) (_ bv8 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} SUMMARY for call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4bv32); srcloc: L609 {8188#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|)) (= |ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:59:39,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {8188#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|)) (= |ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| (_ bv0 32)))} sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {8192#(and (= (_ bv0 32) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)))} is VALID [2022-02-20 23:59:39,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {8192#(and (= (_ bv0 32) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)))} assume !!~bvsgt32(sll_circular_insert_~index#1, 0bv32);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset; {8192#(and (= (_ bv0 32) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)))} is VALID [2022-02-20 23:59:39,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {8192#(and (= (_ bv0 32) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, sll_circular_insert_~last~1#1.offset), #length[sll_circular_insert_~last~1#1.base]) && ~bvule32(sll_circular_insert_~last~1#1.offset, ~bvadd32(4bv32, sll_circular_insert_~last~1#1.offset))) && ~bvule32(0bv32, sll_circular_insert_~last~1#1.offset)); {8062#false} is VALID [2022-02-20 23:59:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:39,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:39,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [974125582] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:39,907 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:59:39,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-02-20 23:59:39,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878568632] [2022-02-20 23:59:39,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:39,908 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-02-20 23:59:39,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:39,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:59:40,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:40,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 23:59:40,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:40,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 23:59:40,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=760, Unknown=5, NotChecked=0, Total=870 [2022-02-20 23:59:40,087 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand has 25 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:59:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:44,202 INFO L93 Difference]: Finished difference Result 232 states and 252 transitions. [2022-02-20 23:59:44,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:59:44,202 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-02-20 23:59:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:59:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 253 transitions. [2022-02-20 23:59:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:59:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 253 transitions. [2022-02-20 23:59:44,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 253 transitions. [2022-02-20 23:59:44,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 252 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:44,502 INFO L225 Difference]: With dead ends: 232 [2022-02-20 23:59:44,502 INFO L226 Difference]: Without dead ends: 232 [2022-02-20 23:59:44,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=166, Invalid=1157, Unknown=9, NotChecked=0, Total=1332 [2022-02-20 23:59:44,502 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 128 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:44,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 598 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 409 Invalid, 0 Unknown, 294 Unchecked, 1.2s Time] [2022-02-20 23:59:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-02-20 23:59:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 131. [2022-02-20 23:59:44,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:44,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 131 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 126 states have internal predecessors, (137), 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:44,505 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 131 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 126 states have internal predecessors, (137), 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:44,505 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 131 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 126 states have internal predecessors, (137), 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:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:44,508 INFO L93 Difference]: Finished difference Result 232 states and 252 transitions. [2022-02-20 23:59:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 252 transitions. [2022-02-20 23:59:44,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:44,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:44,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 126 states have internal predecessors, (137), 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 232 states. [2022-02-20 23:59:44,509 INFO L87 Difference]: Start difference. First operand has 131 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 126 states have internal predecessors, (137), 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 232 states.