./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0521.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0521.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 aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:46:02,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:46:02,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:46:02,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:46:02,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:46:02,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:46:02,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:46:02,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:46:02,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:46:02,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:46:02,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:46:02,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:46:02,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:46:02,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:46:02,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:46:02,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:46:02,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:46:02,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:46:02,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:46:02,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:46:02,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:46:02,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:46:02,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:46:02,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:46:02,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:46:02,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:46:02,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:46:02,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:46:02,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:46:02,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:46:02,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:46:02,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:46:02,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:46:02,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:46:02,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:46:02,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:46:02,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:46:02,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:46:02,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:46:02,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:46:02,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:46:02,289 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:46:02,311 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:46:02,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:46:02,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:46:02,312 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:46:02,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:46:02,313 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:46:02,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:46:02,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:46:02,313 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:46:02,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:46:02,314 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:46:02,314 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:46:02,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:46:02,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:46:02,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:46:02,315 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:46:02,315 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:46:02,315 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:46:02,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:46:02,316 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:46:02,316 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:46:02,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:46:02,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:46:02,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:46:02,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:46:02,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:02,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:46:02,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:46:02,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:46:02,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:46:02,317 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 -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2022-02-20 23:46:02,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:46:02,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:46:02,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:46:02,470 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:46:02,471 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:46:02,471 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0521.i [2022-02-20 23:46:02,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f89d5684/0c9d27e54d51402aa05a6c13833d4101/FLAG2a5db4a4b [2022-02-20 23:46:02,905 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:46:02,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2022-02-20 23:46:02,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f89d5684/0c9d27e54d51402aa05a6c13833d4101/FLAG2a5db4a4b [2022-02-20 23:46:03,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f89d5684/0c9d27e54d51402aa05a6c13833d4101 [2022-02-20 23:46:03,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:46:03,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:46:03,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:03,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:46:03,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:46:03,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:03,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e85351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03, skipping insertion in model container [2022-02-20 23:46:03,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:03,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:46:03,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:46:03,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:03,573 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:46:03,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:03,666 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:46:03,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03 WrapperNode [2022-02-20 23:46:03,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:03,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:03,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:46:03,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:46:03,675 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:46:03" (1/1) ... [2022-02-20 23:46:03,694 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:46:03" (1/1) ... [2022-02-20 23:46:03,727 INFO L137 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 305 [2022-02-20 23:46:03,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:03,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:46:03,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:46:03,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:46:03,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:03,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:03,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:03,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:03,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:03,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:03,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:03,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:46:03,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:46:03,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:46:03,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:46:03,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:03,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:03,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:03,789 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:46:03,794 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:46:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:46:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:46:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:46:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:46:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:46:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:46:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:46:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:46:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:46:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:46:03,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:46:03,896 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:46:03,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:46:04,580 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:46:04,588 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:46:04,588 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 23:46:04,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:04 BoogieIcfgContainer [2022-02-20 23:46:04,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:46:04,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:46:04,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:46:04,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:46:04,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:46:03" (1/3) ... [2022-02-20 23:46:04,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1046e317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:04, skipping insertion in model container [2022-02-20 23:46:04,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (2/3) ... [2022-02-20 23:46:04,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1046e317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:04, skipping insertion in model container [2022-02-20 23:46:04,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:04" (3/3) ... [2022-02-20 23:46:04,595 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0521.i [2022-02-20 23:46:04,598 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:46:04,599 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2022-02-20 23:46:04,625 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:46:04,630 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:46:04,630 INFO L340 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2022-02-20 23:46:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 160 states have (on average 2.1875) internal successors, (350), 312 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:04,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:46:04,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:04,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:46:04,649 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash 28729512, now seen corresponding path program 1 times [2022-02-20 23:46:04,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:04,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908247551] [2022-02-20 23:46:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:04,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:04,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {316#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {316#true} is VALID [2022-02-20 23:46:04,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {316#true} is VALID [2022-02-20 23:46:04,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume !true; {317#false} is VALID [2022-02-20 23:46:04,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {317#false} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {317#false} is VALID [2022-02-20 23:46:04,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {317#false} assume !(1 == #valid[main_~#iter~0#1.base]); {317#false} is VALID [2022-02-20 23:46:04,748 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:46:04,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:04,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908247551] [2022-02-20 23:46:04,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908247551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:04,749 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:04,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:04,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529914232] [2022-02-20 23:46:04,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:04,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:46:04,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:04,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:04,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:04,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:46:04,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:04,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:46:04,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:46:04,778 INFO L87 Difference]: Start difference. First operand has 313 states, 160 states have (on average 2.1875) internal successors, (350), 312 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:04,954 INFO L93 Difference]: Finished difference Result 313 states and 340 transitions. [2022-02-20 23:46:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:46:04,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:46:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 350 transitions. [2022-02-20 23:46:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 350 transitions. [2022-02-20 23:46:04,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 350 transitions. [2022-02-20 23:46:05,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 350 edges. 350 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:05,272 INFO L225 Difference]: With dead ends: 313 [2022-02-20 23:46:05,273 INFO L226 Difference]: Without dead ends: 311 [2022-02-20 23:46:05,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:46:05,279 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:05,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-02-20 23:46:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2022-02-20 23:46:05,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:05,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 311 states, 159 states have (on average 2.1257861635220126) internal successors, (338), 310 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,329 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 311 states, 159 states have (on average 2.1257861635220126) internal successors, (338), 310 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,330 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 311 states, 159 states have (on average 2.1257861635220126) internal successors, (338), 310 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:05,339 INFO L93 Difference]: Finished difference Result 311 states and 338 transitions. [2022-02-20 23:46:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 338 transitions. [2022-02-20 23:46:05,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:05,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:05,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 311 states, 159 states have (on average 2.1257861635220126) internal successors, (338), 310 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 311 states. [2022-02-20 23:46:05,342 INFO L87 Difference]: Start difference. First operand has 311 states, 159 states have (on average 2.1257861635220126) internal successors, (338), 310 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 311 states. [2022-02-20 23:46:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:05,351 INFO L93 Difference]: Finished difference Result 311 states and 338 transitions. [2022-02-20 23:46:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 338 transitions. [2022-02-20 23:46:05,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:05,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:05,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:05,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 159 states have (on average 2.1257861635220126) internal successors, (338), 310 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 338 transitions. [2022-02-20 23:46:05,362 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 338 transitions. Word has length 5 [2022-02-20 23:46:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:05,362 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 338 transitions. [2022-02-20 23:46:05,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 338 transitions. [2022-02-20 23:46:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:46:05,363 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:05,363 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:46:05,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:46:05,364 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:05,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:05,364 INFO L85 PathProgramCache]: Analyzing trace with hash 889570248, now seen corresponding path program 1 times [2022-02-20 23:46:05,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:05,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009173024] [2022-02-20 23:46:05,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:05,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:05,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {1566#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1566#true} is VALID [2022-02-20 23:46:05,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {1566#true} is VALID [2022-02-20 23:46:05,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1566#true} is VALID [2022-02-20 23:46:05,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {1566#true} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {1566#true} is VALID [2022-02-20 23:46:05,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {1566#true} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {1568#(= (select |#valid| |ULTIMATE.start_main_~#iter~0#1.base|) 1)} is VALID [2022-02-20 23:46:05,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {1568#(= (select |#valid| |ULTIMATE.start_main_~#iter~0#1.base|) 1)} assume !(1 == #valid[main_~#iter~0#1.base]); {1567#false} is VALID [2022-02-20 23:46:05,396 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:46:05,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:05,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009173024] [2022-02-20 23:46:05,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009173024] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:05,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:05,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:05,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465831829] [2022-02-20 23:46:05,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:05,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:05,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:05,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,403 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:46:05,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:05,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:05,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:05,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:05,406 INFO L87 Difference]: Start difference. First operand 311 states and 338 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:05,746 INFO L93 Difference]: Finished difference Result 295 states and 322 transitions. [2022-02-20 23:46:05,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:05,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2022-02-20 23:46:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2022-02-20 23:46:05,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 338 transitions. [2022-02-20 23:46:05,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 338 edges. 338 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:05,986 INFO L225 Difference]: With dead ends: 295 [2022-02-20 23:46:05,986 INFO L226 Difference]: Without dead ends: 295 [2022-02-20 23:46:05,986 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:46:05,988 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 77 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:05,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 406 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-02-20 23:46:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-02-20 23:46:05,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:05,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand has 295 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 294 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,996 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand has 295 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 294 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,997 INFO L87 Difference]: Start difference. First operand 295 states. Second operand has 295 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 294 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:06,005 INFO L93 Difference]: Finished difference Result 295 states and 322 transitions. [2022-02-20 23:46:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 322 transitions. [2022-02-20 23:46:06,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:06,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:06,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 294 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 295 states. [2022-02-20 23:46:06,007 INFO L87 Difference]: Start difference. First operand has 295 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 294 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 295 states. [2022-02-20 23:46:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:06,024 INFO L93 Difference]: Finished difference Result 295 states and 322 transitions. [2022-02-20 23:46:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 322 transitions. [2022-02-20 23:46:06,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:06,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:06,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:06,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 294 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 322 transitions. [2022-02-20 23:46:06,033 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 322 transitions. Word has length 6 [2022-02-20 23:46:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:06,033 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 322 transitions. [2022-02-20 23:46:06,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 322 transitions. [2022-02-20 23:46:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:46:06,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:06,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:46:06,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:46:06,035 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:06,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:06,035 INFO L85 PathProgramCache]: Analyzing trace with hash 889570249, now seen corresponding path program 1 times [2022-02-20 23:46:06,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:06,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999930830] [2022-02-20 23:46:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:06,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {2751#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2751#true} is VALID [2022-02-20 23:46:06,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {2751#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {2751#true} is VALID [2022-02-20 23:46:06,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {2751#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2751#true} is VALID [2022-02-20 23:46:06,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {2751#true} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {2751#true} is VALID [2022-02-20 23:46:06,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {2751#true} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {2753#(and (= |ULTIMATE.start_main_~#iter~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:06,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {2753#(and (= |ULTIMATE.start_main_~#iter~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~#iter~0#1.base|)))} assume !(4 + main_~#iter~0#1.offset <= #length[main_~#iter~0#1.base] && 0 <= main_~#iter~0#1.offset); {2752#false} is VALID [2022-02-20 23:46:06,073 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:46:06,073 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:06,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999930830] [2022-02-20 23:46:06,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999930830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:06,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:06,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:06,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264197128] [2022-02-20 23:46:06,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:06,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:06,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:06,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,079 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:46:06,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:06,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:06,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:06,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:06,081 INFO L87 Difference]: Start difference. First operand 295 states and 322 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:06,418 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2022-02-20 23:46:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:06,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2022-02-20 23:46:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2022-02-20 23:46:06,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 322 transitions. [2022-02-20 23:46:06,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 322 edges. 322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:06,629 INFO L225 Difference]: With dead ends: 279 [2022-02-20 23:46:06,629 INFO L226 Difference]: Without dead ends: 279 [2022-02-20 23:46:06,629 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:46:06,630 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 61 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:06,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 415 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-02-20 23:46:06,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-02-20 23:46:06,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:06,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand has 279 states, 159 states have (on average 1.9245283018867925) internal successors, (306), 278 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,635 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand has 279 states, 159 states have (on average 1.9245283018867925) internal successors, (306), 278 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,636 INFO L87 Difference]: Start difference. First operand 279 states. Second operand has 279 states, 159 states have (on average 1.9245283018867925) internal successors, (306), 278 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:06,641 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2022-02-20 23:46:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 306 transitions. [2022-02-20 23:46:06,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:06,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:06,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 279 states, 159 states have (on average 1.9245283018867925) internal successors, (306), 278 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 279 states. [2022-02-20 23:46:06,642 INFO L87 Difference]: Start difference. First operand has 279 states, 159 states have (on average 1.9245283018867925) internal successors, (306), 278 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 279 states. [2022-02-20 23:46:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:06,647 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2022-02-20 23:46:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 306 transitions. [2022-02-20 23:46:06,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:06,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:06,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:06,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 159 states have (on average 1.9245283018867925) internal successors, (306), 278 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 306 transitions. [2022-02-20 23:46:06,654 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 306 transitions. Word has length 6 [2022-02-20 23:46:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:06,654 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 306 transitions. [2022-02-20 23:46:06,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 306 transitions. [2022-02-20 23:46:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:46:06,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:06,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:46:06,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:46:06,655 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:06,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2022-02-20 23:46:06,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:06,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283414632] [2022-02-20 23:46:06,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:06,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {3872#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3872#true} is VALID [2022-02-20 23:46:06,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {3872#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {3872#true} is VALID [2022-02-20 23:46:06,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {3872#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {3872#true} is VALID [2022-02-20 23:46:06,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {3872#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {3874#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} is VALID [2022-02-20 23:46:06,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {3874#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {3874#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} is VALID [2022-02-20 23:46:06,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {3874#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} assume !(1 == #valid[main_~node~0#1.base]); {3873#false} is VALID [2022-02-20 23:46:06,694 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:46:06,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:06,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283414632] [2022-02-20 23:46:06,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283414632] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:06,695 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:06,695 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:06,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631191846] [2022-02-20 23:46:06,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:06,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:06,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:06,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,700 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:46:06,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:06,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:06,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:06,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:06,701 INFO L87 Difference]: Start difference. First operand 279 states and 306 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,083 INFO L93 Difference]: Finished difference Result 334 states and 370 transitions. [2022-02-20 23:46:07,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:07,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 23:46:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 23:46:07,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 372 transitions. [2022-02-20 23:46:07,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:07,316 INFO L225 Difference]: With dead ends: 334 [2022-02-20 23:46:07,317 INFO L226 Difference]: Without dead ends: 334 [2022-02-20 23:46:07,317 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:46:07,318 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:07,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 481 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-02-20 23:46:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 277. [2022-02-20 23:46:07,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:07,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand has 277 states, 159 states have (on average 1.9119496855345912) internal successors, (304), 276 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,323 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand has 277 states, 159 states have (on average 1.9119496855345912) internal successors, (304), 276 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,323 INFO L87 Difference]: Start difference. First operand 334 states. Second operand has 277 states, 159 states have (on average 1.9119496855345912) internal successors, (304), 276 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,331 INFO L93 Difference]: Finished difference Result 334 states and 370 transitions. [2022-02-20 23:46:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 370 transitions. [2022-02-20 23:46:07,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:07,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:07,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 159 states have (on average 1.9119496855345912) internal successors, (304), 276 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 334 states. [2022-02-20 23:46:07,332 INFO L87 Difference]: Start difference. First operand has 277 states, 159 states have (on average 1.9119496855345912) internal successors, (304), 276 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 334 states. [2022-02-20 23:46:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,339 INFO L93 Difference]: Finished difference Result 334 states and 370 transitions. [2022-02-20 23:46:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 370 transitions. [2022-02-20 23:46:07,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:07,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:07,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:07,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:07,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 159 states have (on average 1.9119496855345912) internal successors, (304), 276 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 304 transitions. [2022-02-20 23:46:07,346 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 304 transitions. Word has length 6 [2022-02-20 23:46:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:07,346 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 304 transitions. [2022-02-20 23:46:07,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 304 transitions. [2022-02-20 23:46:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:46:07,347 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:07,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:46:07,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:46:07,347 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2022-02-20 23:46:07,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:07,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86862719] [2022-02-20 23:46:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:07,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {5156#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5156#true} is VALID [2022-02-20 23:46:07,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {5156#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {5156#true} is VALID [2022-02-20 23:46:07,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {5156#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {5156#true} is VALID [2022-02-20 23:46:07,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {5156#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {5158#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} is VALID [2022-02-20 23:46:07,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {5158#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {5158#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} is VALID [2022-02-20 23:46:07,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {5158#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} assume !(4 + (4 + main_~node~0#1.offset) <= #length[main_~node~0#1.base] && 0 <= 4 + main_~node~0#1.offset); {5157#false} is VALID [2022-02-20 23:46:07,374 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:46:07,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:07,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86862719] [2022-02-20 23:46:07,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86862719] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:07,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:07,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:07,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494713651] [2022-02-20 23:46:07,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:07,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:07,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:07,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,379 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:46:07,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:07,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:07,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:07,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:07,380 INFO L87 Difference]: Start difference. First operand 277 states and 304 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,934 INFO L93 Difference]: Finished difference Result 466 states and 515 transitions. [2022-02-20 23:46:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:07,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2022-02-20 23:46:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2022-02-20 23:46:07,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 517 transitions. [2022-02-20 23:46:08,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 517 edges. 517 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:08,260 INFO L225 Difference]: With dead ends: 466 [2022-02-20 23:46:08,260 INFO L226 Difference]: Without dead ends: 466 [2022-02-20 23:46:08,261 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:46:08,261 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 220 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:08,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 579 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-02-20 23:46:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 275. [2022-02-20 23:46:08,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:08,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 466 states. Second operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,266 INFO L74 IsIncluded]: Start isIncluded. First operand 466 states. Second operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,267 INFO L87 Difference]: Start difference. First operand 466 states. Second operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:08,276 INFO L93 Difference]: Finished difference Result 466 states and 515 transitions. [2022-02-20 23:46:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 515 transitions. [2022-02-20 23:46:08,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:08,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:08,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 466 states. [2022-02-20 23:46:08,278 INFO L87 Difference]: Start difference. First operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 466 states. [2022-02-20 23:46:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:08,286 INFO L93 Difference]: Finished difference Result 466 states and 515 transitions. [2022-02-20 23:46:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 515 transitions. [2022-02-20 23:46:08,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:08,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:08,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:08,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 302 transitions. [2022-02-20 23:46:08,292 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 302 transitions. Word has length 6 [2022-02-20 23:46:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:08,292 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 302 transitions. [2022-02-20 23:46:08,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 302 transitions. [2022-02-20 23:46:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:46:08,293 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:08,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:08,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:46:08,293 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:08,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash 178517033, now seen corresponding path program 1 times [2022-02-20 23:46:08,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:08,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583509071] [2022-02-20 23:46:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:08,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {6834#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {6834#true} is VALID [2022-02-20 23:46:08,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {6834#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {6836#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:08,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {6836#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {6836#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:08,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {6836#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {6836#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:08,363 INFO L290 TraceCheckUtils]: 4: Hoare triple {6836#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {6837#(and (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:46:08,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {6837#(and (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {6837#(and (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:46:08,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {6837#(and (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {6835#false} is VALID [2022-02-20 23:46:08,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {6835#false} assume !(1 == #valid[main_~list~0#1.base]); {6835#false} is VALID [2022-02-20 23:46:08,364 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:46:08,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:08,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583509071] [2022-02-20 23:46:08,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583509071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:08,365 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:08,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:08,365 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762027701] [2022-02-20 23:46:08,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:08,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:46:08,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:08,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:08,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:08,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:08,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:08,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:08,371 INFO L87 Difference]: Start difference. First operand 275 states and 302 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:08,945 INFO L93 Difference]: Finished difference Result 678 states and 747 transitions. [2022-02-20 23:46:08,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:08,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:46:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:08,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 748 transitions. [2022-02-20 23:46:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 748 transitions. [2022-02-20 23:46:08,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 748 transitions. [2022-02-20 23:46:09,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 748 edges. 748 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:09,408 INFO L225 Difference]: With dead ends: 678 [2022-02-20 23:46:09,409 INFO L226 Difference]: Without dead ends: 678 [2022-02-20 23:46:09,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:09,411 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 597 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:09,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 870 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-02-20 23:46:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 280. [2022-02-20 23:46:09,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:09,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 678 states. Second operand has 280 states, 164 states have (on average 1.8780487804878048) internal successors, (308), 279 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,416 INFO L74 IsIncluded]: Start isIncluded. First operand 678 states. Second operand has 280 states, 164 states have (on average 1.8780487804878048) internal successors, (308), 279 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,416 INFO L87 Difference]: Start difference. First operand 678 states. Second operand has 280 states, 164 states have (on average 1.8780487804878048) internal successors, (308), 279 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:09,431 INFO L93 Difference]: Finished difference Result 678 states and 747 transitions. [2022-02-20 23:46:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 747 transitions. [2022-02-20 23:46:09,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:09,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:09,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 280 states, 164 states have (on average 1.8780487804878048) internal successors, (308), 279 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 678 states. [2022-02-20 23:46:09,433 INFO L87 Difference]: Start difference. First operand has 280 states, 164 states have (on average 1.8780487804878048) internal successors, (308), 279 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 678 states. [2022-02-20 23:46:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:09,449 INFO L93 Difference]: Finished difference Result 678 states and 747 transitions. [2022-02-20 23:46:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 747 transitions. [2022-02-20 23:46:09,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:09,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:09,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:09,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 164 states have (on average 1.8780487804878048) internal successors, (308), 279 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 308 transitions. [2022-02-20 23:46:09,459 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 308 transitions. Word has length 8 [2022-02-20 23:46:09,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:09,460 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 308 transitions. [2022-02-20 23:46:09,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,460 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 308 transitions. [2022-02-20 23:46:09,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:46:09,460 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:09,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:09,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:46:09,461 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:09,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660206, now seen corresponding path program 1 times [2022-02-20 23:46:09,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:09,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535032947] [2022-02-20 23:46:09,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:09,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:09,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {9156#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9156#true} is VALID [2022-02-20 23:46:09,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {9156#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {9156#true} is VALID [2022-02-20 23:46:09,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {9156#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {9156#true} is VALID [2022-02-20 23:46:09,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {9156#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {9156#true} is VALID [2022-02-20 23:46:09,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {9156#true} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {9156#true} is VALID [2022-02-20 23:46:09,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {9156#true} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {9156#true} is VALID [2022-02-20 23:46:09,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {9156#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {9156#true} is VALID [2022-02-20 23:46:09,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {9156#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {9156#true} is VALID [2022-02-20 23:46:09,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {9156#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {9158#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:09,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {9158#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {9158#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:09,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {9158#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} assume !(1 == #valid[main_~item~0#1.base]); {9157#false} is VALID [2022-02-20 23:46:09,497 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:46:09,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:09,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535032947] [2022-02-20 23:46:09,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535032947] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:09,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:09,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:09,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497546238] [2022-02-20 23:46:09,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:09,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:46:09,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:09,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:09,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:09,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:09,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:09,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:09,506 INFO L87 Difference]: Start difference. First operand 280 states and 308 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:09,873 INFO L93 Difference]: Finished difference Result 330 states and 365 transitions. [2022-02-20 23:46:09,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:09,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:46:09,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-02-20 23:46:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-02-20 23:46:09,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 367 transitions. [2022-02-20 23:46:10,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:10,097 INFO L225 Difference]: With dead ends: 330 [2022-02-20 23:46:10,097 INFO L226 Difference]: Without dead ends: 330 [2022-02-20 23:46:10,097 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:46:10,098 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 72 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:10,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 476 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:10,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-02-20 23:46:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 278. [2022-02-20 23:46:10,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:10,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 278 states, 164 states have (on average 1.8658536585365855) internal successors, (306), 277 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,102 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 278 states, 164 states have (on average 1.8658536585365855) internal successors, (306), 277 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,102 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 278 states, 164 states have (on average 1.8658536585365855) internal successors, (306), 277 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:10,107 INFO L93 Difference]: Finished difference Result 330 states and 365 transitions. [2022-02-20 23:46:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 365 transitions. [2022-02-20 23:46:10,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:10,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:10,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 278 states, 164 states have (on average 1.8658536585365855) internal successors, (306), 277 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 330 states. [2022-02-20 23:46:10,108 INFO L87 Difference]: Start difference. First operand has 278 states, 164 states have (on average 1.8658536585365855) internal successors, (306), 277 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 330 states. [2022-02-20 23:46:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:10,112 INFO L93 Difference]: Finished difference Result 330 states and 365 transitions. [2022-02-20 23:46:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 365 transitions. [2022-02-20 23:46:10,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:10,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:10,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:10,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 164 states have (on average 1.8658536585365855) internal successors, (306), 277 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2022-02-20 23:46:10,117 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 11 [2022-02-20 23:46:10,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:10,117 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2022-02-20 23:46:10,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2022-02-20 23:46:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:46:10,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:10,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:10,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:46:10,118 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:10,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:10,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660205, now seen corresponding path program 1 times [2022-02-20 23:46:10,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:10,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534906855] [2022-02-20 23:46:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:10,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {10429#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10429#true} is VALID [2022-02-20 23:46:10,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {10429#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {10429#true} is VALID [2022-02-20 23:46:10,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {10429#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {10429#true} is VALID [2022-02-20 23:46:10,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {10429#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {10429#true} is VALID [2022-02-20 23:46:10,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {10429#true} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {10429#true} is VALID [2022-02-20 23:46:10,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {10429#true} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {10429#true} is VALID [2022-02-20 23:46:10,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {10429#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {10429#true} is VALID [2022-02-20 23:46:10,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {10429#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {10429#true} is VALID [2022-02-20 23:46:10,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {10429#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {10431#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:46:10,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {10431#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {10431#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:46:10,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {10431#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} assume !(4 + main_~item~0#1.offset <= #length[main_~item~0#1.base] && 0 <= main_~item~0#1.offset); {10430#false} is VALID [2022-02-20 23:46:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:10,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:10,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534906855] [2022-02-20 23:46:10,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534906855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:10,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:10,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:10,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497697699] [2022-02-20 23:46:10,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:10,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:46:10,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:10,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:10,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:10,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:10,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:10,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:10,157 INFO L87 Difference]: Start difference. First operand 278 states and 306 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:10,690 INFO L93 Difference]: Finished difference Result 462 states and 510 transitions. [2022-02-20 23:46:10,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:10,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:46:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-02-20 23:46:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-02-20 23:46:10,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 512 transitions. [2022-02-20 23:46:11,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 512 edges. 512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:11,009 INFO L225 Difference]: With dead ends: 462 [2022-02-20 23:46:11,010 INFO L226 Difference]: Without dead ends: 462 [2022-02-20 23:46:11,010 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:46:11,010 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 216 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:11,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 574 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-02-20 23:46:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 276. [2022-02-20 23:46:11,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:11,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 462 states. Second operand has 276 states, 164 states have (on average 1.853658536585366) internal successors, (304), 275 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:11,015 INFO L74 IsIncluded]: Start isIncluded. First operand 462 states. Second operand has 276 states, 164 states have (on average 1.853658536585366) internal successors, (304), 275 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:11,015 INFO L87 Difference]: Start difference. First operand 462 states. Second operand has 276 states, 164 states have (on average 1.853658536585366) internal successors, (304), 275 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:11,023 INFO L93 Difference]: Finished difference Result 462 states and 510 transitions. [2022-02-20 23:46:11,023 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 510 transitions. [2022-02-20 23:46:11,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:11,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:11,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 276 states, 164 states have (on average 1.853658536585366) internal successors, (304), 275 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 462 states. [2022-02-20 23:46:11,025 INFO L87 Difference]: Start difference. First operand has 276 states, 164 states have (on average 1.853658536585366) internal successors, (304), 275 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 462 states. [2022-02-20 23:46:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:11,033 INFO L93 Difference]: Finished difference Result 462 states and 510 transitions. [2022-02-20 23:46:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 510 transitions. [2022-02-20 23:46:11,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:11,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:11,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:11,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 164 states have (on average 1.853658536585366) internal successors, (304), 275 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2022-02-20 23:46:11,038 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 11 [2022-02-20 23:46:11,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:11,038 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2022-02-20 23:46:11,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2022-02-20 23:46:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:46:11,039 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:11,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:11,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:46:11,039 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:11,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1231388841, now seen corresponding path program 1 times [2022-02-20 23:46:11,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:11,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881469971] [2022-02-20 23:46:11,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:11,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:11,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {12096#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12096#true} is VALID [2022-02-20 23:46:11,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {12096#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {12098#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:11,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {12098#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12098#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:11,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {12098#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {12098#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:11,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {12098#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {12099#(and (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:46:11,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {12099#(and (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {12100#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} is VALID [2022-02-20 23:46:11,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {12100#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} assume !(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {12100#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} is VALID [2022-02-20 23:46:11,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {12100#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} havoc main_~node~1#1.base, main_~node~1#1.offset; {12100#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} is VALID [2022-02-20 23:46:11,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {12100#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {12101#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= |ULTIMATE.start_main_#t~mem8#1.base| 0))} is VALID [2022-02-20 23:46:11,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {12101#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= |ULTIMATE.start_main_#t~mem8#1.base| 0))} assume !(main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {12097#false} is VALID [2022-02-20 23:46:11,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {12097#false} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L567 {12097#false} is VALID [2022-02-20 23:46:11,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {12097#false} main_~current~0#1.base, main_~current~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {12097#false} is VALID [2022-02-20 23:46:11,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {12097#false} assume !(1 == #valid[main_~current~0#1.base]); {12097#false} is VALID [2022-02-20 23:46:11,120 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:46:11,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:11,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881469971] [2022-02-20 23:46:11,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881469971] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:11,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:11,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:46:11,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504300187] [2022-02-20 23:46:11,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:11,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:46:11,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:11,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:11,129 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:46:11,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:46:11,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:11,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:46:11,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:46:11,130 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:12,082 INFO L93 Difference]: Finished difference Result 666 states and 735 transitions. [2022-02-20 23:46:12,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:46:12,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:46:12,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:12,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 736 transitions. [2022-02-20 23:46:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 736 transitions. [2022-02-20 23:46:12,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 736 transitions. [2022-02-20 23:46:12,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 736 edges. 736 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:12,571 INFO L225 Difference]: With dead ends: 666 [2022-02-20 23:46:12,571 INFO L226 Difference]: Without dead ends: 666 [2022-02-20 23:46:12,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:46:12,572 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 576 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:12,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 1363 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-02-20 23:46:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 279. [2022-02-20 23:46:12,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:12,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 666 states. Second operand has 279 states, 167 states have (on average 1.8383233532934131) internal successors, (307), 278 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:12,577 INFO L74 IsIncluded]: Start isIncluded. First operand 666 states. Second operand has 279 states, 167 states have (on average 1.8383233532934131) internal successors, (307), 278 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:12,577 INFO L87 Difference]: Start difference. First operand 666 states. Second operand has 279 states, 167 states have (on average 1.8383233532934131) internal successors, (307), 278 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:12,590 INFO L93 Difference]: Finished difference Result 666 states and 735 transitions. [2022-02-20 23:46:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 735 transitions. [2022-02-20 23:46:12,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:12,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:12,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 279 states, 167 states have (on average 1.8383233532934131) internal successors, (307), 278 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 666 states. [2022-02-20 23:46:12,592 INFO L87 Difference]: Start difference. First operand has 279 states, 167 states have (on average 1.8383233532934131) internal successors, (307), 278 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 666 states. [2022-02-20 23:46:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:12,605 INFO L93 Difference]: Finished difference Result 666 states and 735 transitions. [2022-02-20 23:46:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 735 transitions. [2022-02-20 23:46:12,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:12,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:12,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:12,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 167 states have (on average 1.8383233532934131) internal successors, (307), 278 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2022-02-20 23:46:12,610 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 13 [2022-02-20 23:46:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:12,610 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2022-02-20 23:46:12,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2022-02-20 23:46:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:46:12,611 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:12,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:12,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:46:12,611 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:12,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:12,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2035528525, now seen corresponding path program 1 times [2022-02-20 23:46:12,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:12,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959064262] [2022-02-20 23:46:12,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:12,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:12,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {14387#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14387#true} is VALID [2022-02-20 23:46:12,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {14387#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:12,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:12,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:12,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:12,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:12,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:12,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} havoc main_~node~1#1.base, main_~node~1#1.offset; {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:12,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:12,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~node~1#1.base, main_~node~1#1.offset := 0, 0; {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:12,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~node~1#1.base != 0 || main_~node~1#1.offset != 0); {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:12,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {14389#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call ULTIMATE.dealloc(main_~#iter~0#1.base, main_~#iter~0#1.offset);havoc main_~#iter~0#1.base, main_~#iter~0#1.offset;main_~list~1#1.base, main_~list~1#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {14390#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} is VALID [2022-02-20 23:46:12,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {14390#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} main_#t~short23#1 := main_~list~1#1.base != 0 || main_~list~1#1.offset != 0; {14391#(not |ULTIMATE.start_main_#t~short23#1|)} is VALID [2022-02-20 23:46:12,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {14391#(not |ULTIMATE.start_main_#t~short23#1|)} assume main_#t~short23#1; {14388#false} is VALID [2022-02-20 23:46:12,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {14388#false} assume !(1 == #valid[main_~list~1#1.base]); {14388#false} is VALID [2022-02-20 23:46:12,656 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:46:12,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:12,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959064262] [2022-02-20 23:46:12,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959064262] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:12,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:12,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:46:12,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695285335] [2022-02-20 23:46:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:12,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:46:12,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:12,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:12,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:12,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:12,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:12,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:12,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:12,668 INFO L87 Difference]: Start difference. First operand 279 states and 307 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:13,236 INFO L93 Difference]: Finished difference Result 408 states and 447 transitions. [2022-02-20 23:46:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:46:13,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:46:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2022-02-20 23:46:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2022-02-20 23:46:13,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 451 transitions. [2022-02-20 23:46:13,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:13,521 INFO L225 Difference]: With dead ends: 408 [2022-02-20 23:46:13,521 INFO L226 Difference]: Without dead ends: 408 [2022-02-20 23:46:13,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:13,522 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 237 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:13,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 1120 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-02-20 23:46:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 343. [2022-02-20 23:46:13,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:13,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 408 states. Second operand has 343 states, 231 states have (on average 1.8831168831168832) internal successors, (435), 342 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,528 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand has 343 states, 231 states have (on average 1.8831168831168832) internal successors, (435), 342 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,528 INFO L87 Difference]: Start difference. First operand 408 states. Second operand has 343 states, 231 states have (on average 1.8831168831168832) internal successors, (435), 342 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:13,534 INFO L93 Difference]: Finished difference Result 408 states and 447 transitions. [2022-02-20 23:46:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 447 transitions. [2022-02-20 23:46:13,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:13,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:13,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 343 states, 231 states have (on average 1.8831168831168832) internal successors, (435), 342 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 408 states. [2022-02-20 23:46:13,535 INFO L87 Difference]: Start difference. First operand has 343 states, 231 states have (on average 1.8831168831168832) internal successors, (435), 342 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 408 states. [2022-02-20 23:46:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:13,542 INFO L93 Difference]: Finished difference Result 408 states and 447 transitions. [2022-02-20 23:46:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 447 transitions. [2022-02-20 23:46:13,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:13,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:13,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:13,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 231 states have (on average 1.8831168831168832) internal successors, (435), 342 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 435 transitions. [2022-02-20 23:46:13,548 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 435 transitions. Word has length 15 [2022-02-20 23:46:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:13,548 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 435 transitions. [2022-02-20 23:46:13,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 435 transitions. [2022-02-20 23:46:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:46:13,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:13,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:13,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:46:13,549 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:13,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:13,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1316385230, now seen corresponding path program 1 times [2022-02-20 23:46:13,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:13,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464112858] [2022-02-20 23:46:13,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:13,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:13,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {15965#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {15965#true} is VALID [2022-02-20 23:46:13,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {15965#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {15965#true} is VALID [2022-02-20 23:46:13,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {15965#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15965#true} is VALID [2022-02-20 23:46:13,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {15965#true} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15965#true} is VALID [2022-02-20 23:46:13,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {15965#true} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {15965#true} is VALID [2022-02-20 23:46:13,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {15965#true} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {15965#true} is VALID [2022-02-20 23:46:13,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {15965#true} assume !(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {15965#true} is VALID [2022-02-20 23:46:13,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {15965#true} havoc main_~node~1#1.base, main_~node~1#1.offset; {15965#true} is VALID [2022-02-20 23:46:13,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {15965#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {15965#true} is VALID [2022-02-20 23:46:13,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {15965#true} assume main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~node~1#1.base, main_~node~1#1.offset := 0, 0; {15967#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:46:13,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {15967#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= |ULTIMATE.start_main_~node~1#1.base| 0))} assume !!(main_~node~1#1.base != 0 || main_~node~1#1.offset != 0); {15966#false} is VALID [2022-02-20 23:46:13,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {15966#false} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L580 {15966#false} is VALID [2022-02-20 23:46:13,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {15966#false} assume !(main_#t~mem15#1.base == 0 && main_#t~mem15#1.offset == 0);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {15966#false} is VALID [2022-02-20 23:46:13,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {15966#false} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L583 {15966#false} is VALID [2022-02-20 23:46:13,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {15966#false} main_~current~1#1.base, main_~current~1#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {15966#false} is VALID [2022-02-20 23:46:13,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {15966#false} assume !(1 == #valid[main_~current~1#1.base]); {15966#false} is VALID [2022-02-20 23:46:13,593 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:46:13,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:13,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464112858] [2022-02-20 23:46:13,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464112858] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:13,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:13,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:13,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191990432] [2022-02-20 23:46:13,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:13,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:46:13,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:13,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:13,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:13,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:13,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:13,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:13,603 INFO L87 Difference]: Start difference. First operand 343 states and 435 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:13,808 INFO L93 Difference]: Finished difference Result 328 states and 410 transitions. [2022-02-20 23:46:13,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:13,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:46:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2022-02-20 23:46:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2022-02-20 23:46:13,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 300 transitions. [2022-02-20 23:46:14,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:14,007 INFO L225 Difference]: With dead ends: 328 [2022-02-20 23:46:14,007 INFO L226 Difference]: Without dead ends: 328 [2022-02-20 23:46:14,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:14,008 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 223 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:14,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 363 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-02-20 23:46:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2022-02-20 23:46:14,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:14,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 328 states. Second operand has 328 states, 216 states have (on average 1.8981481481481481) internal successors, (410), 327 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,012 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand has 328 states, 216 states have (on average 1.8981481481481481) internal successors, (410), 327 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,012 INFO L87 Difference]: Start difference. First operand 328 states. Second operand has 328 states, 216 states have (on average 1.8981481481481481) internal successors, (410), 327 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,016 INFO L93 Difference]: Finished difference Result 328 states and 410 transitions. [2022-02-20 23:46:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2022-02-20 23:46:14,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:14,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:14,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 328 states, 216 states have (on average 1.8981481481481481) internal successors, (410), 327 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 328 states. [2022-02-20 23:46:14,017 INFO L87 Difference]: Start difference. First operand has 328 states, 216 states have (on average 1.8981481481481481) internal successors, (410), 327 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 328 states. [2022-02-20 23:46:14,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,021 INFO L93 Difference]: Finished difference Result 328 states and 410 transitions. [2022-02-20 23:46:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2022-02-20 23:46:14,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:14,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:14,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:14,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 216 states have (on average 1.8981481481481481) internal successors, (410), 327 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 410 transitions. [2022-02-20 23:46:14,026 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 410 transitions. Word has length 16 [2022-02-20 23:46:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:14,026 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 410 transitions. [2022-02-20 23:46:14,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2022-02-20 23:46:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:46:14,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:14,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:14,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:46:14,027 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:14,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1932989585, now seen corresponding path program 1 times [2022-02-20 23:46:14,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:14,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080588014] [2022-02-20 23:46:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:14,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {17282#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {17282#true} is VALID [2022-02-20 23:46:14,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {17282#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {17282#true} is VALID [2022-02-20 23:46:14,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {17282#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {17282#true} is VALID [2022-02-20 23:46:14,048 INFO L290 TraceCheckUtils]: 3: Hoare triple {17282#true} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {17282#true} is VALID [2022-02-20 23:46:14,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {17282#true} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {17282#true} is VALID [2022-02-20 23:46:14,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {17282#true} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {17282#true} is VALID [2022-02-20 23:46:14,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {17282#true} assume !(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {17282#true} is VALID [2022-02-20 23:46:14,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {17282#true} havoc main_~node~1#1.base, main_~node~1#1.offset; {17282#true} is VALID [2022-02-20 23:46:14,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {17282#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {17282#true} is VALID [2022-02-20 23:46:14,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {17282#true} assume main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~node~1#1.base, main_~node~1#1.offset := 0, 0; {17282#true} is VALID [2022-02-20 23:46:14,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {17282#true} assume !(main_~node~1#1.base != 0 || main_~node~1#1.offset != 0); {17282#true} is VALID [2022-02-20 23:46:14,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {17282#true} call ULTIMATE.dealloc(main_~#iter~0#1.base, main_~#iter~0#1.offset);havoc main_~#iter~0#1.base, main_~#iter~0#1.offset;main_~list~1#1.base, main_~list~1#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {17282#true} is VALID [2022-02-20 23:46:14,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {17282#true} main_#t~short23#1 := main_~list~1#1.base != 0 || main_~list~1#1.offset != 0; {17282#true} is VALID [2022-02-20 23:46:14,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {17282#true} assume !main_#t~short23#1; {17282#true} is VALID [2022-02-20 23:46:14,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {17282#true} assume !main_#t~short23#1;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~short23#1; {17282#true} is VALID [2022-02-20 23:46:14,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {17282#true} main_~data~0#1.base, main_~data~0#1.offset := main_~list~1#1.base, main_~list~1#1.offset;call main_~#iter~1#1.base, main_~#iter~1#1.offset := #Ultimate.allocOnStack(8);main_~list~2#1.base, main_~list~2#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {17284#(= (select |#valid| |ULTIMATE.start_main_~#iter~1#1.base|) 1)} is VALID [2022-02-20 23:46:14,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {17284#(= (select |#valid| |ULTIMATE.start_main_~#iter~1#1.base|) 1)} assume !(1 == #valid[main_~#iter~1#1.base]); {17283#false} is VALID [2022-02-20 23:46:14,051 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:46:14,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:14,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080588014] [2022-02-20 23:46:14,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080588014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:14,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:14,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:14,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55499912] [2022-02-20 23:46:14,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:14,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:46:14,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:14,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:14,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:14,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:14,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:14,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:14,063 INFO L87 Difference]: Start difference. First operand 328 states and 410 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,370 INFO L93 Difference]: Finished difference Result 312 states and 378 transitions. [2022-02-20 23:46:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:14,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:46:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2022-02-20 23:46:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2022-02-20 23:46:14,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 298 transitions. [2022-02-20 23:46:14,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:14,564 INFO L225 Difference]: With dead ends: 312 [2022-02-20 23:46:14,564 INFO L226 Difference]: Without dead ends: 312 [2022-02-20 23:46:14,564 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:46:14,564 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 77 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:14,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 346 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-02-20 23:46:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-02-20 23:46:14,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:14,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand has 312 states, 216 states have (on average 1.75) internal successors, (378), 311 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,568 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand has 312 states, 216 states have (on average 1.75) internal successors, (378), 311 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,569 INFO L87 Difference]: Start difference. First operand 312 states. Second operand has 312 states, 216 states have (on average 1.75) internal successors, (378), 311 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,572 INFO L93 Difference]: Finished difference Result 312 states and 378 transitions. [2022-02-20 23:46:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 378 transitions. [2022-02-20 23:46:14,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:14,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:14,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 312 states, 216 states have (on average 1.75) internal successors, (378), 311 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 312 states. [2022-02-20 23:46:14,574 INFO L87 Difference]: Start difference. First operand has 312 states, 216 states have (on average 1.75) internal successors, (378), 311 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 312 states. [2022-02-20 23:46:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,577 INFO L93 Difference]: Finished difference Result 312 states and 378 transitions. [2022-02-20 23:46:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 378 transitions. [2022-02-20 23:46:14,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:14,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:14,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:14,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 216 states have (on average 1.75) internal successors, (378), 311 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 378 transitions. [2022-02-20 23:46:14,582 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 378 transitions. Word has length 17 [2022-02-20 23:46:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:14,582 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 378 transitions. [2022-02-20 23:46:14,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 378 transitions. [2022-02-20 23:46:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:46:14,583 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:14,583 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:14,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:46:14,583 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1932989586, now seen corresponding path program 1 times [2022-02-20 23:46:14,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:14,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253111486] [2022-02-20 23:46:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:14,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:14,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {18535#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18535#true} is VALID [2022-02-20 23:46:14,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {18535#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {18535#true} is VALID [2022-02-20 23:46:14,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {18535#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {18535#true} is VALID [2022-02-20 23:46:14,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {18535#true} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {18535#true} is VALID [2022-02-20 23:46:14,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {18535#true} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {18535#true} is VALID [2022-02-20 23:46:14,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {18535#true} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {18535#true} is VALID [2022-02-20 23:46:14,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {18535#true} assume !(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {18535#true} is VALID [2022-02-20 23:46:14,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {18535#true} havoc main_~node~1#1.base, main_~node~1#1.offset; {18535#true} is VALID [2022-02-20 23:46:14,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {18535#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {18535#true} is VALID [2022-02-20 23:46:14,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {18535#true} assume main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~node~1#1.base, main_~node~1#1.offset := 0, 0; {18535#true} is VALID [2022-02-20 23:46:14,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {18535#true} assume !(main_~node~1#1.base != 0 || main_~node~1#1.offset != 0); {18535#true} is VALID [2022-02-20 23:46:14,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {18535#true} call ULTIMATE.dealloc(main_~#iter~0#1.base, main_~#iter~0#1.offset);havoc main_~#iter~0#1.base, main_~#iter~0#1.offset;main_~list~1#1.base, main_~list~1#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {18535#true} is VALID [2022-02-20 23:46:14,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {18535#true} main_#t~short23#1 := main_~list~1#1.base != 0 || main_~list~1#1.offset != 0; {18535#true} is VALID [2022-02-20 23:46:14,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {18535#true} assume !main_#t~short23#1; {18535#true} is VALID [2022-02-20 23:46:14,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {18535#true} assume !main_#t~short23#1;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~short23#1; {18535#true} is VALID [2022-02-20 23:46:14,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {18535#true} main_~data~0#1.base, main_~data~0#1.offset := main_~list~1#1.base, main_~list~1#1.offset;call main_~#iter~1#1.base, main_~#iter~1#1.offset := #Ultimate.allocOnStack(8);main_~list~2#1.base, main_~list~2#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {18537#(and (= (+ (select |#length| |ULTIMATE.start_main_~#iter~1#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~#iter~1#1.offset| 0))} is VALID [2022-02-20 23:46:14,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {18537#(and (= (+ (select |#length| |ULTIMATE.start_main_~#iter~1#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~#iter~1#1.offset| 0))} assume !(4 + main_~#iter~1#1.offset <= #length[main_~#iter~1#1.base] && 0 <= main_~#iter~1#1.offset); {18536#false} is VALID [2022-02-20 23:46:14,635 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:46:14,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:14,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253111486] [2022-02-20 23:46:14,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253111486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:14,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:14,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:14,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973733041] [2022-02-20 23:46:14,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:14,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:46:14,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:14,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:14,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:14,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:14,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:14,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:14,646 INFO L87 Difference]: Start difference. First operand 312 states and 378 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,932 INFO L93 Difference]: Finished difference Result 296 states and 346 transitions. [2022-02-20 23:46:14,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:14,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:46:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2022-02-20 23:46:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2022-02-20 23:46:14,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 282 transitions. [2022-02-20 23:46:15,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:15,112 INFO L225 Difference]: With dead ends: 296 [2022-02-20 23:46:15,112 INFO L226 Difference]: Without dead ends: 296 [2022-02-20 23:46:15,112 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:46:15,113 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 61 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:15,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 355 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-02-20 23:46:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-02-20 23:46:15,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:15,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 296 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 295 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,116 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 296 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 295 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,116 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 296 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 295 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:15,120 INFO L93 Difference]: Finished difference Result 296 states and 346 transitions. [2022-02-20 23:46:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2022-02-20 23:46:15,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:15,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:15,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 295 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 296 states. [2022-02-20 23:46:15,121 INFO L87 Difference]: Start difference. First operand has 296 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 295 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 296 states. [2022-02-20 23:46:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:15,125 INFO L93 Difference]: Finished difference Result 296 states and 346 transitions. [2022-02-20 23:46:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2022-02-20 23:46:15,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:15,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:15,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:15,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 295 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2022-02-20 23:46:15,129 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 17 [2022-02-20 23:46:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:15,130 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2022-02-20 23:46:15,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2022-02-20 23:46:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:46:15,130 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:15,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:15,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:46:15,131 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:15,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2117838446, now seen corresponding path program 1 times [2022-02-20 23:46:15,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:15,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288108099] [2022-02-20 23:46:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:15,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {19724#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {19724#true} is VALID [2022-02-20 23:46:15,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {19724#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:15,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:15,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:15,175 INFO L290 TraceCheckUtils]: 4: Hoare triple {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:15,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:15,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:15,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} havoc main_~node~1#1.base, main_~node~1#1.offset; {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:15,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:15,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~node~1#1.base, main_~node~1#1.offset := 0, 0; {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:15,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~node~1#1.base != 0 || main_~node~1#1.offset != 0); {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:15,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {19726#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call ULTIMATE.dealloc(main_~#iter~0#1.base, main_~#iter~0#1.offset);havoc main_~#iter~0#1.base, main_~#iter~0#1.offset;main_~list~1#1.base, main_~list~1#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {19727#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} is VALID [2022-02-20 23:46:15,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {19727#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} main_#t~short23#1 := main_~list~1#1.base != 0 || main_~list~1#1.offset != 0; {19727#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} is VALID [2022-02-20 23:46:15,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {19727#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} assume !main_#t~short23#1; {19727#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} is VALID [2022-02-20 23:46:15,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {19727#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} assume !main_#t~short23#1;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~short23#1; {19727#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} is VALID [2022-02-20 23:46:15,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {19727#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~list~1#1.base, main_~list~1#1.offset;call main_~#iter~1#1.base, main_~#iter~1#1.offset := #Ultimate.allocOnStack(8);main_~list~2#1.base, main_~list~2#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {19728#(and (= |ULTIMATE.start_main_~list~2#1.offset| 0) (= |ULTIMATE.start_main_~list~2#1.base| 0))} is VALID [2022-02-20 23:46:15,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {19728#(and (= |ULTIMATE.start_main_~list~2#1.offset| 0) (= |ULTIMATE.start_main_~list~2#1.base| 0))} SUMMARY for call write~$Pointer$(main_~list~2#1.base, main_~list~2#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, 4); srcloc: L636 {19728#(and (= |ULTIMATE.start_main_~list~2#1.offset| 0) (= |ULTIMATE.start_main_~list~2#1.base| 0))} is VALID [2022-02-20 23:46:15,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {19728#(and (= |ULTIMATE.start_main_~list~2#1.offset| 0) (= |ULTIMATE.start_main_~list~2#1.base| 0))} assume main_~list~2#1.base != 0 || main_~list~2#1.offset != 0; {19725#false} is VALID [2022-02-20 23:46:15,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {19725#false} assume !(1 == #valid[main_~list~2#1.base]); {19725#false} is VALID [2022-02-20 23:46:15,180 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:46:15,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:15,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288108099] [2022-02-20 23:46:15,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288108099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:15,181 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:15,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:46:15,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403804115] [2022-02-20 23:46:15,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:15,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:15,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:15,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:15,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:15,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:15,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:15,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:15,195 INFO L87 Difference]: Start difference. First operand 296 states and 346 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:15,711 INFO L93 Difference]: Finished difference Result 394 states and 436 transitions. [2022-02-20 23:46:15,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:46:15,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 435 transitions. [2022-02-20 23:46:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 435 transitions. [2022-02-20 23:46:15,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 435 transitions. [2022-02-20 23:46:15,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 435 edges. 435 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:15,971 INFO L225 Difference]: With dead ends: 394 [2022-02-20 23:46:15,971 INFO L226 Difference]: Without dead ends: 394 [2022-02-20 23:46:15,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:15,972 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 277 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:15,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 994 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-02-20 23:46:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 293. [2022-02-20 23:46:15,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:15,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 293 states, 213 states have (on average 1.596244131455399) internal successors, (340), 292 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,976 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 293 states, 213 states have (on average 1.596244131455399) internal successors, (340), 292 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,976 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 293 states, 213 states have (on average 1.596244131455399) internal successors, (340), 292 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:15,982 INFO L93 Difference]: Finished difference Result 394 states and 436 transitions. [2022-02-20 23:46:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 436 transitions. [2022-02-20 23:46:15,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:15,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:15,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 213 states have (on average 1.596244131455399) internal successors, (340), 292 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 394 states. [2022-02-20 23:46:15,983 INFO L87 Difference]: Start difference. First operand has 293 states, 213 states have (on average 1.596244131455399) internal successors, (340), 292 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 394 states. [2022-02-20 23:46:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:15,988 INFO L93 Difference]: Finished difference Result 394 states and 436 transitions. [2022-02-20 23:46:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 436 transitions. [2022-02-20 23:46:15,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:15,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:15,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:15,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 213 states have (on average 1.596244131455399) internal successors, (340), 292 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 340 transitions. [2022-02-20 23:46:15,993 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 340 transitions. Word has length 19 [2022-02-20 23:46:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:15,993 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 340 transitions. [2022-02-20 23:46:15,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 340 transitions. [2022-02-20 23:46:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:46:15,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:15,994 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:15,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:46:15,994 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:15,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:15,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279430, now seen corresponding path program 1 times [2022-02-20 23:46:15,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:15,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178827252] [2022-02-20 23:46:15,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:15,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:16,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {21212#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21212#true} is VALID [2022-02-20 23:46:16,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {21212#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {21212#true} is VALID [2022-02-20 23:46:16,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {21212#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {21212#true} is VALID [2022-02-20 23:46:16,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {21212#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {21212#true} is VALID [2022-02-20 23:46:16,042 INFO L290 TraceCheckUtils]: 4: Hoare triple {21212#true} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {21212#true} is VALID [2022-02-20 23:46:16,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {21212#true} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {21212#true} is VALID [2022-02-20 23:46:16,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {21212#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {21212#true} is VALID [2022-02-20 23:46:16,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {21212#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {21212#true} is VALID [2022-02-20 23:46:16,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {21212#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {21214#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:16,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {21214#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {21214#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:16,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {21214#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {21214#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:16,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {21214#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {21214#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:16,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {21214#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {21215#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:46:16,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {21215#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {21215#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:46:16,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {21215#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {21215#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:46:16,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {21215#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {21216#(or (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|))} is VALID [2022-02-20 23:46:16,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {21216#(or (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {21217#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:46:16,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {21217#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {21217#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:46:16,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {21217#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !(1 == #valid[main_~list~0#1.base]); {21213#false} is VALID [2022-02-20 23:46:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:16,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:16,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178827252] [2022-02-20 23:46:16,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178827252] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:16,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:16,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:46:16,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439508772] [2022-02-20 23:46:16,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:16,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:16,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:16,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:16,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:46:16,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:16,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:46:16,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:46:16,060 INFO L87 Difference]: Start difference. First operand 293 states and 340 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:16,796 INFO L93 Difference]: Finished difference Result 316 states and 364 transitions. [2022-02-20 23:46:16,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:46:16,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 304 transitions. [2022-02-20 23:46:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 304 transitions. [2022-02-20 23:46:16,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 304 transitions. [2022-02-20 23:46:16,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:16,987 INFO L225 Difference]: With dead ends: 316 [2022-02-20 23:46:16,987 INFO L226 Difference]: Without dead ends: 316 [2022-02-20 23:46:16,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:16,987 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 213 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:16,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 670 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:46:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-02-20 23:46:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 295. [2022-02-20 23:46:16,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:16,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 295 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 294 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,992 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 295 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 294 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,993 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 295 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 294 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:16,997 INFO L93 Difference]: Finished difference Result 316 states and 364 transitions. [2022-02-20 23:46:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 364 transitions. [2022-02-20 23:46:16,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:16,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:16,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 294 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 316 states. [2022-02-20 23:46:16,998 INFO L87 Difference]: Start difference. First operand has 295 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 294 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 316 states. [2022-02-20 23:46:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:17,004 INFO L93 Difference]: Finished difference Result 316 states and 364 transitions. [2022-02-20 23:46:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 364 transitions. [2022-02-20 23:46:17,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:17,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:17,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:17,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 294 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 345 transitions. [2022-02-20 23:46:17,009 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 345 transitions. Word has length 19 [2022-02-20 23:46:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:17,009 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 345 transitions. [2022-02-20 23:46:17,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 345 transitions. [2022-02-20 23:46:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:46:17,010 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:17,010 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:17,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:46:17,010 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279429, now seen corresponding path program 1 times [2022-02-20 23:46:17,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:17,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985131220] [2022-02-20 23:46:17,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:17,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:17,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {22468#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {22468#true} is VALID [2022-02-20 23:46:17,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {22468#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {22468#true} is VALID [2022-02-20 23:46:17,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {22468#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {22468#true} is VALID [2022-02-20 23:46:17,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {22468#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {22468#true} is VALID [2022-02-20 23:46:17,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {22468#true} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {22468#true} is VALID [2022-02-20 23:46:17,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {22468#true} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {22468#true} is VALID [2022-02-20 23:46:17,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {22468#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {22468#true} is VALID [2022-02-20 23:46:17,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {22468#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {22468#true} is VALID [2022-02-20 23:46:17,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {22468#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {22470#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:46:17,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {22470#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {22470#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:46:17,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {22470#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {22470#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:46:17,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {22470#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {22470#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:46:17,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {22470#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {22471#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:17,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {22471#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {22471#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:17,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {22471#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {22471#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:17,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {22471#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {22472#(and (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:46:17,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {22472#(and (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {22472#(and (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:46:17,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {22472#(and (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {22472#(and (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:46:17,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {22472#(and (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(4 + main_~list~0#1.offset <= #length[main_~list~0#1.base] && 0 <= main_~list~0#1.offset); {22469#false} is VALID [2022-02-20 23:46:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:17,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:17,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985131220] [2022-02-20 23:46:17,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985131220] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:17,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:17,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:17,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726176158] [2022-02-20 23:46:17,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:17,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:17,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:17,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:17,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:17,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:17,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:17,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:17,113 INFO L87 Difference]: Start difference. First operand 295 states and 345 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:17,959 INFO L93 Difference]: Finished difference Result 409 states and 475 transitions. [2022-02-20 23:46:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:46:17,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 398 transitions. [2022-02-20 23:46:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 398 transitions. [2022-02-20 23:46:17,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 398 transitions. [2022-02-20 23:46:18,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:18,211 INFO L225 Difference]: With dead ends: 409 [2022-02-20 23:46:18,211 INFO L226 Difference]: Without dead ends: 409 [2022-02-20 23:46:18,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:18,211 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 437 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:18,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 647 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-02-20 23:46:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 294. [2022-02-20 23:46:18,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:18,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 409 states. Second operand has 294 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 293 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:18,216 INFO L74 IsIncluded]: Start isIncluded. First operand 409 states. Second operand has 294 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 293 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:18,216 INFO L87 Difference]: Start difference. First operand 409 states. Second operand has 294 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 293 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:18,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:18,223 INFO L93 Difference]: Finished difference Result 409 states and 475 transitions. [2022-02-20 23:46:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 475 transitions. [2022-02-20 23:46:18,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:18,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:18,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 293 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 409 states. [2022-02-20 23:46:18,228 INFO L87 Difference]: Start difference. First operand has 294 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 293 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 409 states. [2022-02-20 23:46:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:18,235 INFO L93 Difference]: Finished difference Result 409 states and 475 transitions. [2022-02-20 23:46:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 475 transitions. [2022-02-20 23:46:18,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:18,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:18,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:18,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 293 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 344 transitions. [2022-02-20 23:46:18,239 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 344 transitions. Word has length 19 [2022-02-20 23:46:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:18,239 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 344 transitions. [2022-02-20 23:46:18,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 344 transitions. [2022-02-20 23:46:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:46:18,240 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:18,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:18,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:46:18,241 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:18,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash -805519643, now seen corresponding path program 1 times [2022-02-20 23:46:18,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:18,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132023989] [2022-02-20 23:46:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:18,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {24003#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24003#true} is VALID [2022-02-20 23:46:18,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {24003#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:18,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:18,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:18,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:18,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:18,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:18,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} havoc main_~node~1#1.base, main_~node~1#1.offset; {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:18,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:18,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~node~1#1.base, main_~node~1#1.offset := 0, 0; {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:18,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~node~1#1.base != 0 || main_~node~1#1.offset != 0); {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:18,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {24005#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call ULTIMATE.dealloc(main_~#iter~0#1.base, main_~#iter~0#1.offset);havoc main_~#iter~0#1.base, main_~#iter~0#1.offset;main_~list~1#1.base, main_~list~1#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {24006#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} is VALID [2022-02-20 23:46:18,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {24006#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} main_#t~short23#1 := main_~list~1#1.base != 0 || main_~list~1#1.offset != 0; {24006#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} is VALID [2022-02-20 23:46:18,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {24006#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} assume !main_#t~short23#1; {24006#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} is VALID [2022-02-20 23:46:18,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {24006#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} assume !main_#t~short23#1;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~short23#1; {24006#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} is VALID [2022-02-20 23:46:18,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {24006#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= |ULTIMATE.start_main_~list~1#1.base| 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~list~1#1.base, main_~list~1#1.offset;call main_~#iter~1#1.base, main_~#iter~1#1.offset := #Ultimate.allocOnStack(8);main_~list~2#1.base, main_~list~2#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {24007#(and (= |ULTIMATE.start_main_~list~2#1.offset| 0) (= |ULTIMATE.start_main_~list~2#1.base| 0))} is VALID [2022-02-20 23:46:18,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {24007#(and (= |ULTIMATE.start_main_~list~2#1.offset| 0) (= |ULTIMATE.start_main_~list~2#1.base| 0))} SUMMARY for call write~$Pointer$(main_~list~2#1.base, main_~list~2#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, 4); srcloc: L636 {24008#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~1#1.base|) |ULTIMATE.start_main_~#iter~1#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~1#1.base|) |ULTIMATE.start_main_~#iter~1#1.offset|) 0))} is VALID [2022-02-20 23:46:18,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {24008#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~1#1.base|) |ULTIMATE.start_main_~#iter~1#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~1#1.base|) |ULTIMATE.start_main_~#iter~1#1.offset|) 0))} assume !(main_~list~2#1.base != 0 || main_~list~2#1.offset != 0); {24008#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~1#1.base|) |ULTIMATE.start_main_~#iter~1#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~1#1.base|) |ULTIMATE.start_main_~#iter~1#1.offset|) 0))} is VALID [2022-02-20 23:46:18,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {24008#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~1#1.base|) |ULTIMATE.start_main_~#iter~1#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~1#1.base|) |ULTIMATE.start_main_~#iter~1#1.offset|) 0))} havoc main_~node~3#1.base, main_~node~3#1.offset; {24008#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~1#1.base|) |ULTIMATE.start_main_~#iter~1#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~1#1.base|) |ULTIMATE.start_main_~#iter~1#1.offset|) 0))} is VALID [2022-02-20 23:46:18,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {24008#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~1#1.base|) |ULTIMATE.start_main_~#iter~1#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~1#1.base|) |ULTIMATE.start_main_~#iter~1#1.offset|) 0))} SUMMARY for call main_#t~mem40#1.base, main_#t~mem40#1.offset := read~$Pointer$(main_~#iter~1#1.base, main_~#iter~1#1.offset, 4); srcloc: L641 {24009#(and (= |ULTIMATE.start_main_#t~mem40#1.base| 0) (= |ULTIMATE.start_main_#t~mem40#1.offset| 0))} is VALID [2022-02-20 23:46:18,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {24009#(and (= |ULTIMATE.start_main_#t~mem40#1.base| 0) (= |ULTIMATE.start_main_#t~mem40#1.offset| 0))} assume !(main_#t~mem40#1.base == 0 && main_#t~mem40#1.offset == 0);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset; {24004#false} is VALID [2022-02-20 23:46:18,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {24004#false} SUMMARY for call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~#iter~1#1.base, 4 + main_~#iter~1#1.offset, 4); srcloc: L644 {24004#false} is VALID [2022-02-20 23:46:18,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {24004#false} main_~current~2#1.base, main_~current~2#1.offset := main_#t~mem41#1.base, main_#t~mem41#1.offset;havoc main_#t~mem41#1.base, main_#t~mem41#1.offset; {24004#false} is VALID [2022-02-20 23:46:18,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {24004#false} assume !(1 == #valid[main_~current~2#1.base]); {24004#false} is VALID [2022-02-20 23:46:18,334 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:46:18,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:18,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132023989] [2022-02-20 23:46:18,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132023989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:18,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:18,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:46:18,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935576280] [2022-02-20 23:46:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:18,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:46:18,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:18,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:18,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:18,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:46:18,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:18,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:46:18,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:18,351 INFO L87 Difference]: Start difference. First operand 294 states and 344 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:19,154 INFO L93 Difference]: Finished difference Result 394 states and 442 transitions. [2022-02-20 23:46:19,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:46:19,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:46:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 427 transitions. [2022-02-20 23:46:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 427 transitions. [2022-02-20 23:46:19,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 427 transitions. [2022-02-20 23:46:19,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:19,396 INFO L225 Difference]: With dead ends: 394 [2022-02-20 23:46:19,397 INFO L226 Difference]: Without dead ends: 394 [2022-02-20 23:46:19,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:46:19,397 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 251 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:19,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 1409 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-02-20 23:46:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 280. [2022-02-20 23:46:19,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:19,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 280 states, 203 states have (on average 1.5812807881773399) internal successors, (321), 279 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:19,401 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 280 states, 203 states have (on average 1.5812807881773399) internal successors, (321), 279 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:19,401 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 280 states, 203 states have (on average 1.5812807881773399) internal successors, (321), 279 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:19,407 INFO L93 Difference]: Finished difference Result 394 states and 442 transitions. [2022-02-20 23:46:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 442 transitions. [2022-02-20 23:46:19,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:19,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:19,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 280 states, 203 states have (on average 1.5812807881773399) internal successors, (321), 279 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 394 states. [2022-02-20 23:46:19,408 INFO L87 Difference]: Start difference. First operand has 280 states, 203 states have (on average 1.5812807881773399) internal successors, (321), 279 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 394 states. [2022-02-20 23:46:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:19,413 INFO L93 Difference]: Finished difference Result 394 states and 442 transitions. [2022-02-20 23:46:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 442 transitions. [2022-02-20 23:46:19,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:19,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:19,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:19,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.5812807881773399) internal successors, (321), 279 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 321 transitions. [2022-02-20 23:46:19,417 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 321 transitions. Word has length 24 [2022-02-20 23:46:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:19,418 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 321 transitions. [2022-02-20 23:46:19,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 321 transitions. [2022-02-20 23:46:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:46:19,418 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:19,418 INFO L514 BasicCegarLoop]: trace histogram [2, 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:46:19,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:46:19,419 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:19,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:19,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1972902682, now seen corresponding path program 1 times [2022-02-20 23:46:19,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:19,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688506656] [2022-02-20 23:46:19,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:19,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:19,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {25484#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {25484#true} is VALID [2022-02-20 23:46:19,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {25484#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {25484#true} is VALID [2022-02-20 23:46:19,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {25484#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {25484#true} is VALID [2022-02-20 23:46:19,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {25484#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {25484#true} is VALID [2022-02-20 23:46:19,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {25484#true} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {25484#true} is VALID [2022-02-20 23:46:19,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {25484#true} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {25484#true} is VALID [2022-02-20 23:46:19,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {25484#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {25484#true} is VALID [2022-02-20 23:46:19,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {25484#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {25484#true} is VALID [2022-02-20 23:46:19,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {25484#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {25486#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:19,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {25486#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {25486#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:19,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {25486#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {25486#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:19,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {25486#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {25486#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:19,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {25486#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {25487#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:19,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {25487#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {25487#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:19,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {25487#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {25487#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:19,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {25487#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {25488#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:46:19,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {25488#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {25488#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 23:46:19,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {25488#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume !(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {25485#false} is VALID [2022-02-20 23:46:19,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {25485#false} havoc main_~node~1#1.base, main_~node~1#1.offset; {25485#false} is VALID [2022-02-20 23:46:19,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {25485#false} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {25485#false} is VALID [2022-02-20 23:46:19,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {25485#false} assume !(main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {25485#false} is VALID [2022-02-20 23:46:19,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {25485#false} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L567 {25485#false} is VALID [2022-02-20 23:46:19,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {25485#false} main_~current~0#1.base, main_~current~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {25485#false} is VALID [2022-02-20 23:46:19,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {25485#false} assume !(1 == #valid[main_~current~0#1.base]); {25485#false} is VALID [2022-02-20 23:46:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:19,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:19,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688506656] [2022-02-20 23:46:19,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688506656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:19,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:19,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:46:19,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155223345] [2022-02-20 23:46:19,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:19,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:46:19,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:19,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:19,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:19,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:19,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:19,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:19,470 INFO L87 Difference]: Start difference. First operand 280 states and 321 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:19,841 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2022-02-20 23:46:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:46:19,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:46:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 323 transitions. [2022-02-20 23:46:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 323 transitions. [2022-02-20 23:46:19,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 323 transitions. [2022-02-20 23:46:20,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:20,051 INFO L225 Difference]: With dead ends: 298 [2022-02-20 23:46:20,051 INFO L226 Difference]: Without dead ends: 298 [2022-02-20 23:46:20,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:20,051 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 667 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:20,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [667 Valid, 560 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-02-20 23:46:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 280. [2022-02-20 23:46:20,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:20,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states. Second operand has 280 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 279 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,055 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand has 280 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 279 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,055 INFO L87 Difference]: Start difference. First operand 298 states. Second operand has 280 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 279 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:20,058 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2022-02-20 23:46:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 331 transitions. [2022-02-20 23:46:20,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:20,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:20,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 280 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 279 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 298 states. [2022-02-20 23:46:20,059 INFO L87 Difference]: Start difference. First operand has 280 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 279 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 298 states. [2022-02-20 23:46:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:20,062 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2022-02-20 23:46:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 331 transitions. [2022-02-20 23:46:20,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:20,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:20,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:20,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 279 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 320 transitions. [2022-02-20 23:46:20,066 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 320 transitions. Word has length 24 [2022-02-20 23:46:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:20,067 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 320 transitions. [2022-02-20 23:46:20,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 320 transitions. [2022-02-20 23:46:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:46:20,067 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:20,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:20,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:46:20,068 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr151ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:20,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1021020451, now seen corresponding path program 1 times [2022-02-20 23:46:20,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:20,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417749794] [2022-02-20 23:46:20,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:20,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:20,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {26672#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26672#true} is VALID [2022-02-20 23:46:20,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {26672#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:20,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:20,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:20,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_~node~1#1.base, main_~node~1#1.offset; {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~node~1#1.base, main_~node~1#1.offset := 0, 0; {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !(main_~node~1#1.base != 0 || main_~node~1#1.offset != 0); {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {26675#(= (store |#valid| |ULTIMATE.start_main_~#iter~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} call ULTIMATE.dealloc(main_~#iter~0#1.base, main_~#iter~0#1.offset);havoc main_~#iter~0#1.base, main_~#iter~0#1.offset;main_~list~1#1.base, main_~list~1#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:20,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#t~short23#1 := main_~list~1#1.base != 0 || main_~list~1#1.offset != 0; {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:20,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !main_#t~short23#1; {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:20,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !main_#t~short23#1;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~short23#1; {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:20,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_~data~0#1.base, main_~data~0#1.offset := main_~list~1#1.base, main_~list~1#1.offset;call main_~#iter~1#1.base, main_~#iter~1#1.offset := #Ultimate.allocOnStack(8);main_~list~2#1.base, main_~list~2#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~$Pointer$(main_~list~2#1.base, main_~list~2#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, 4); srcloc: L636 {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !(main_~list~2#1.base != 0 || main_~list~2#1.offset != 0); {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_~node~3#1.base, main_~node~3#1.offset; {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call main_#t~mem40#1.base, main_#t~mem40#1.offset := read~$Pointer$(main_~#iter~1#1.base, main_~#iter~1#1.offset, 4); srcloc: L641 {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume main_#t~mem40#1.base == 0 && main_#t~mem40#1.offset == 0;havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;main_~node~3#1.base, main_~node~3#1.offset := 0, 0; {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !(main_~node~3#1.base != 0 || main_~node~3#1.offset != 0); {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:20,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {26676#(= (store |#valid| |ULTIMATE.start_main_~#iter~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} call ULTIMATE.dealloc(main_~#iter~1#1.base, main_~#iter~1#1.offset);havoc main_~#iter~1#1.base, main_~#iter~1#1.offset; {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:20,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:20,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:20,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {26674#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {26673#false} is VALID [2022-02-20 23:46:20,112 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:46:20,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:20,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417749794] [2022-02-20 23:46:20,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417749794] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:20,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:20,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:20,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59045564] [2022-02-20 23:46:20,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:20,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:46:20,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:20,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,128 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:46:20,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:20,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:20,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:20,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:20,129 INFO L87 Difference]: Start difference. First operand 280 states and 320 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:20,736 INFO L93 Difference]: Finished difference Result 288 states and 321 transitions. [2022-02-20 23:46:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:20,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:46:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 313 transitions. [2022-02-20 23:46:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 313 transitions. [2022-02-20 23:46:20,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 313 transitions. [2022-02-20 23:46:20,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:20,950 INFO L225 Difference]: With dead ends: 288 [2022-02-20 23:46:20,950 INFO L226 Difference]: Without dead ends: 284 [2022-02-20 23:46:20,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:20,950 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 26 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:20,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 663 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-02-20 23:46:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2022-02-20 23:46:20,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:20,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 278 states, 201 states have (on average 1.5771144278606966) internal successors, (317), 277 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,953 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 278 states, 201 states have (on average 1.5771144278606966) internal successors, (317), 277 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,954 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 278 states, 201 states have (on average 1.5771144278606966) internal successors, (317), 277 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:20,958 INFO L93 Difference]: Finished difference Result 284 states and 317 transitions. [2022-02-20 23:46:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 317 transitions. [2022-02-20 23:46:20,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:20,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:20,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 278 states, 201 states have (on average 1.5771144278606966) internal successors, (317), 277 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 284 states. [2022-02-20 23:46:20,959 INFO L87 Difference]: Start difference. First operand has 278 states, 201 states have (on average 1.5771144278606966) internal successors, (317), 277 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 284 states. [2022-02-20 23:46:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:20,963 INFO L93 Difference]: Finished difference Result 284 states and 317 transitions. [2022-02-20 23:46:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 317 transitions. [2022-02-20 23:46:20,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:20,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:20,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:20,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 201 states have (on average 1.5771144278606966) internal successors, (317), 277 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 317 transitions. [2022-02-20 23:46:20,967 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 317 transitions. Word has length 26 [2022-02-20 23:46:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:20,968 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 317 transitions. [2022-02-20 23:46:20,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 317 transitions. [2022-02-20 23:46:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:46:20,968 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:20,968 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:20,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:46:20,969 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:20,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1580222949, now seen corresponding path program 1 times [2022-02-20 23:46:20,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:20,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163342597] [2022-02-20 23:46:20,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:20,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:21,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {27813#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27813#true} is VALID [2022-02-20 23:46:21,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {27813#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {27813#true} is VALID [2022-02-20 23:46:21,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {27813#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {27813#true} is VALID [2022-02-20 23:46:21,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {27813#true} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {27813#true} is VALID [2022-02-20 23:46:21,006 INFO L290 TraceCheckUtils]: 4: Hoare triple {27813#true} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {27813#true} is VALID [2022-02-20 23:46:21,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {27813#true} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {27813#true} is VALID [2022-02-20 23:46:21,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {27813#true} assume !(main_~list~0#1.base != 0 || main_~list~0#1.offset != 0); {27813#true} is VALID [2022-02-20 23:46:21,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {27813#true} havoc main_~node~1#1.base, main_~node~1#1.offset; {27813#true} is VALID [2022-02-20 23:46:21,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {27813#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {27813#true} is VALID [2022-02-20 23:46:21,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {27813#true} assume main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~node~1#1.base, main_~node~1#1.offset := 0, 0; {27813#true} is VALID [2022-02-20 23:46:21,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {27813#true} assume !(main_~node~1#1.base != 0 || main_~node~1#1.offset != 0); {27813#true} is VALID [2022-02-20 23:46:21,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {27813#true} call ULTIMATE.dealloc(main_~#iter~0#1.base, main_~#iter~0#1.offset);havoc main_~#iter~0#1.base, main_~#iter~0#1.offset;main_~list~1#1.base, main_~list~1#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {27813#true} is VALID [2022-02-20 23:46:21,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {27813#true} main_#t~short23#1 := main_~list~1#1.base != 0 || main_~list~1#1.offset != 0; {27813#true} is VALID [2022-02-20 23:46:21,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {27813#true} assume !main_#t~short23#1; {27813#true} is VALID [2022-02-20 23:46:21,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {27813#true} assume !main_#t~short23#1;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~short23#1; {27813#true} is VALID [2022-02-20 23:46:21,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {27813#true} main_~data~0#1.base, main_~data~0#1.offset := main_~list~1#1.base, main_~list~1#1.offset;call main_~#iter~1#1.base, main_~#iter~1#1.offset := #Ultimate.allocOnStack(8);main_~list~2#1.base, main_~list~2#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {27813#true} is VALID [2022-02-20 23:46:21,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {27813#true} SUMMARY for call write~$Pointer$(main_~list~2#1.base, main_~list~2#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, 4); srcloc: L636 {27813#true} is VALID [2022-02-20 23:46:21,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {27813#true} assume !(main_~list~2#1.base != 0 || main_~list~2#1.offset != 0); {27813#true} is VALID [2022-02-20 23:46:21,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {27813#true} havoc main_~node~3#1.base, main_~node~3#1.offset; {27813#true} is VALID [2022-02-20 23:46:21,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {27813#true} SUMMARY for call main_#t~mem40#1.base, main_#t~mem40#1.offset := read~$Pointer$(main_~#iter~1#1.base, main_~#iter~1#1.offset, 4); srcloc: L641 {27813#true} is VALID [2022-02-20 23:46:21,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {27813#true} assume main_#t~mem40#1.base == 0 && main_#t~mem40#1.offset == 0;havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;main_~node~3#1.base, main_~node~3#1.offset := 0, 0; {27815#(and (= |ULTIMATE.start_main_~node~3#1.offset| 0) (= |ULTIMATE.start_main_~node~3#1.base| 0))} is VALID [2022-02-20 23:46:21,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {27815#(and (= |ULTIMATE.start_main_~node~3#1.offset| 0) (= |ULTIMATE.start_main_~node~3#1.base| 0))} assume !!(main_~node~3#1.base != 0 || main_~node~3#1.offset != 0); {27814#false} is VALID [2022-02-20 23:46:21,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {27814#false} SUMMARY for call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~#iter~1#1.base, main_~#iter~1#1.offset, 4); srcloc: L657 {27814#false} is VALID [2022-02-20 23:46:21,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {27814#false} assume !(main_#t~mem47#1.base == 0 && main_#t~mem47#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset; {27814#false} is VALID [2022-02-20 23:46:21,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {27814#false} SUMMARY for call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~#iter~1#1.base, 4 + main_~#iter~1#1.offset, 4); srcloc: L660 {27814#false} is VALID [2022-02-20 23:46:21,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {27814#false} main_~current~3#1.base, main_~current~3#1.offset := main_#t~mem48#1.base, main_#t~mem48#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {27814#false} is VALID [2022-02-20 23:46:21,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {27814#false} assume !(1 == #valid[main_~current~3#1.base]); {27814#false} is VALID [2022-02-20 23:46:21,012 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:46:21,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:21,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163342597] [2022-02-20 23:46:21,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163342597] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:21,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:21,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:21,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135271471] [2022-02-20 23:46:21,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:21,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:46:21,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:21,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:21,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:21,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:21,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:21,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:21,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:21,028 INFO L87 Difference]: Start difference. First operand 278 states and 317 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:21,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:21,210 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2022-02-20 23:46:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:21,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:46:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2022-02-20 23:46:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2022-02-20 23:46:21,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 265 transitions. [2022-02-20 23:46:21,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:21,378 INFO L225 Difference]: With dead ends: 263 [2022-02-20 23:46:21,378 INFO L226 Difference]: Without dead ends: 245 [2022-02-20 23:46:21,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:21,379 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 31 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:21,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 485 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:21,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-02-20 23:46:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2022-02-20 23:46:21,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:21,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand has 245 states, 168 states have (on average 1.630952380952381) internal successors, (274), 244 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:21,381 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand has 245 states, 168 states have (on average 1.630952380952381) internal successors, (274), 244 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:21,382 INFO L87 Difference]: Start difference. First operand 245 states. Second operand has 245 states, 168 states have (on average 1.630952380952381) internal successors, (274), 244 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:21,384 INFO L93 Difference]: Finished difference Result 245 states and 274 transitions. [2022-02-20 23:46:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2022-02-20 23:46:21,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:21,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:21,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 168 states have (on average 1.630952380952381) internal successors, (274), 244 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 245 states. [2022-02-20 23:46:21,386 INFO L87 Difference]: Start difference. First operand has 245 states, 168 states have (on average 1.630952380952381) internal successors, (274), 244 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 245 states. [2022-02-20 23:46:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:21,389 INFO L93 Difference]: Finished difference Result 245 states and 274 transitions. [2022-02-20 23:46:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2022-02-20 23:46:21,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:21,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:21,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:21,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 168 states have (on average 1.630952380952381) internal successors, (274), 244 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2022-02-20 23:46:21,393 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 27 [2022-02-20 23:46:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:21,393 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2022-02-20 23:46:21,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2022-02-20 23:46:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:46:21,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:21,394 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:21,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:46:21,394 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:21,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1161321696, now seen corresponding path program 1 times [2022-02-20 23:46:21,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:21,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310255383] [2022-02-20 23:46:21,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:21,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:21,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {28816#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {28816#true} is VALID [2022-02-20 23:46:21,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {28816#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {28816#true} is VALID [2022-02-20 23:46:21,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {28816#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28816#true} is VALID [2022-02-20 23:46:21,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {28816#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {28818#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} is VALID [2022-02-20 23:46:21,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {28818#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {28818#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} is VALID [2022-02-20 23:46:21,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {28818#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {28818#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} is VALID [2022-02-20 23:46:21,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {28818#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {28818#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} is VALID [2022-02-20 23:46:21,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {28818#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {28818#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} is VALID [2022-02-20 23:46:21,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {28818#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1)} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {28819#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1))} is VALID [2022-02-20 23:46:21,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {28819#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {28819#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1))} is VALID [2022-02-20 23:46:21,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {28819#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {28820#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:21,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {28820#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {28820#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:21,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {28820#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {28821#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} is VALID [2022-02-20 23:46:21,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {28821#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28821#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} is VALID [2022-02-20 23:46:21,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {28821#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {28821#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} is VALID [2022-02-20 23:46:21,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {28821#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {28822#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:21,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {28822#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {28823#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:21,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {28823#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {28823#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:21,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {28823#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L560 {28824#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:46:21,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {28824#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L560-1 {28825#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:46:21,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {28825#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 1)} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {28825#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:46:21,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {28825#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 1)} havoc main_~node~1#1.base, main_~node~1#1.offset; {28825#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:46:21,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {28825#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 1)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {28825#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:46:21,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {28825#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 1)} assume !(main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {28825#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:46:21,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {28825#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 1)} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L567 {28826#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:46:21,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {28826#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} main_~current~0#1.base, main_~current~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {28827#(= (select |#valid| |ULTIMATE.start_main_~current~0#1.base|) 1)} is VALID [2022-02-20 23:46:21,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {28827#(= (select |#valid| |ULTIMATE.start_main_~current~0#1.base|) 1)} assume !(1 == #valid[main_~current~0#1.base]); {28817#false} is VALID [2022-02-20 23:46:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:21,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:21,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310255383] [2022-02-20 23:46:21,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310255383] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:21,549 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:21,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:46:21,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71045498] [2022-02-20 23:46:21,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:21,550 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:46:21,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:21,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:21,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:21,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:46:21,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:21,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:46:21,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:46:21,568 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:23,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:23,503 INFO L93 Difference]: Finished difference Result 251 states and 280 transitions. [2022-02-20 23:46:23,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:46:23,503 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:46:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 271 transitions. [2022-02-20 23:46:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 271 transitions. [2022-02-20 23:46:23,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 271 transitions. [2022-02-20 23:46:23,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:23,664 INFO L225 Difference]: With dead ends: 251 [2022-02-20 23:46:23,664 INFO L226 Difference]: Without dead ends: 251 [2022-02-20 23:46:23,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:46:23,664 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 257 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:23,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 1314 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 23:46:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-02-20 23:46:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 244. [2022-02-20 23:46:23,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:23,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 244 states, 168 states have (on average 1.625) internal successors, (273), 243 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:23,667 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 244 states, 168 states have (on average 1.625) internal successors, (273), 243 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:23,667 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 244 states, 168 states have (on average 1.625) internal successors, (273), 243 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:23,670 INFO L93 Difference]: Finished difference Result 251 states and 280 transitions. [2022-02-20 23:46:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 280 transitions. [2022-02-20 23:46:23,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:23,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:23,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 168 states have (on average 1.625) internal successors, (273), 243 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 251 states. [2022-02-20 23:46:23,671 INFO L87 Difference]: Start difference. First operand has 244 states, 168 states have (on average 1.625) internal successors, (273), 243 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 251 states. [2022-02-20 23:46:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:23,674 INFO L93 Difference]: Finished difference Result 251 states and 280 transitions. [2022-02-20 23:46:23,674 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 280 transitions. [2022-02-20 23:46:23,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:23,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:23,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:23,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 168 states have (on average 1.625) internal successors, (273), 243 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 273 transitions. [2022-02-20 23:46:23,677 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 273 transitions. Word has length 27 [2022-02-20 23:46:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:23,678 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 273 transitions. [2022-02-20 23:46:23,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 273 transitions. [2022-02-20 23:46:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:46:23,678 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:23,678 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:23,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:46:23,678 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1161321697, now seen corresponding path program 1 times [2022-02-20 23:46:23,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:23,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339119499] [2022-02-20 23:46:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:23,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {29848#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29848#true} is VALID [2022-02-20 23:46:23,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {29848#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {29848#true} is VALID [2022-02-20 23:46:23,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {29848#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {29848#true} is VALID [2022-02-20 23:46:23,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {29848#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {29850#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} is VALID [2022-02-20 23:46:23,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {29850#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {29850#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} is VALID [2022-02-20 23:46:23,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {29850#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {29851#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} is VALID [2022-02-20 23:46:23,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {29851#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {29851#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} is VALID [2022-02-20 23:46:23,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {29851#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {29851#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} is VALID [2022-02-20 23:46:23,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {29851#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {29852#(and (<= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) 8) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} is VALID [2022-02-20 23:46:23,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {29852#(and (<= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) 8) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {29852#(and (<= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) 8) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} is VALID [2022-02-20 23:46:23,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {29852#(and (<= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) 8) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {29853#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|))) (<= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) 8) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:23,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {29853#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|))) (<= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) 8) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {29853#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|))) (<= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) 8) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:23,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {29853#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|))) (<= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) 8) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {29854#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (<= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 23:46:23,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {29854#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (<= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {29854#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (<= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 23:46:23,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {29854#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (<= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {29854#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (<= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 23:46:23,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {29854#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (<= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {29855#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:23,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {29855#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {29856#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:46:23,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {29856#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {29856#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:46:23,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {29856#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L560 {29857#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem7#1.base|)) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0))} is VALID [2022-02-20 23:46:23,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {29857#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem7#1.base|)) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L560-1 {29858#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:46:23,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {29858#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0))} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {29858#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:46:23,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {29858#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0))} havoc main_~node~1#1.base, main_~node~1#1.offset; {29858#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:46:23,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {29858#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {29858#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:46:23,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {29858#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0))} assume !(main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {29858#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:46:23,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {29858#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L567 {29859#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:46:23,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {29859#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} main_~current~0#1.base, main_~current~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {29860#(and (<= 8 (select |#length| |ULTIMATE.start_main_~current~0#1.base|)) (= |ULTIMATE.start_main_~current~0#1.offset| 0))} is VALID [2022-02-20 23:46:23,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {29860#(and (<= 8 (select |#length| |ULTIMATE.start_main_~current~0#1.base|)) (= |ULTIMATE.start_main_~current~0#1.offset| 0))} assume !(4 + (4 + main_~current~0#1.offset) <= #length[main_~current~0#1.base] && 0 <= 4 + main_~current~0#1.offset); {29849#false} is VALID [2022-02-20 23:46:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:23,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:23,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339119499] [2022-02-20 23:46:23,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339119499] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:23,922 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:23,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 23:46:23,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130477174] [2022-02-20 23:46:23,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:23,923 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:46:23,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:23,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:23,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:23,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:46:23,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:23,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:46:23,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:46:23,943 INFO L87 Difference]: Start difference. First operand 244 states and 273 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:27,796 INFO L93 Difference]: Finished difference Result 504 states and 573 transitions. [2022-02-20 23:46:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:46:27,796 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:46:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 544 transitions. [2022-02-20 23:46:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 544 transitions. [2022-02-20 23:46:27,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 544 transitions. [2022-02-20 23:46:28,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 544 edges. 544 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:28,203 INFO L225 Difference]: With dead ends: 504 [2022-02-20 23:46:28,203 INFO L226 Difference]: Without dead ends: 504 [2022-02-20 23:46:28,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2022-02-20 23:46:28,204 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 489 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 1831 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:28,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 2004 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1831 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 23:46:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-02-20 23:46:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 243. [2022-02-20 23:46:28,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:28,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 504 states. Second operand has 243 states, 168 states have (on average 1.619047619047619) internal successors, (272), 242 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:28,207 INFO L74 IsIncluded]: Start isIncluded. First operand 504 states. Second operand has 243 states, 168 states have (on average 1.619047619047619) internal successors, (272), 242 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:28,208 INFO L87 Difference]: Start difference. First operand 504 states. Second operand has 243 states, 168 states have (on average 1.619047619047619) internal successors, (272), 242 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:28,215 INFO L93 Difference]: Finished difference Result 504 states and 573 transitions. [2022-02-20 23:46:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 573 transitions. [2022-02-20 23:46:28,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:28,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:28,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 168 states have (on average 1.619047619047619) internal successors, (272), 242 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 504 states. [2022-02-20 23:46:28,217 INFO L87 Difference]: Start difference. First operand has 243 states, 168 states have (on average 1.619047619047619) internal successors, (272), 242 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 504 states. [2022-02-20 23:46:28,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:28,225 INFO L93 Difference]: Finished difference Result 504 states and 573 transitions. [2022-02-20 23:46:28,225 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 573 transitions. [2022-02-20 23:46:28,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:28,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:28,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:28,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 168 states have (on average 1.619047619047619) internal successors, (272), 242 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 272 transitions. [2022-02-20 23:46:28,228 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 272 transitions. Word has length 27 [2022-02-20 23:46:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:28,229 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 272 transitions. [2022-02-20 23:46:28,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 272 transitions. [2022-02-20 23:46:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:46:28,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:28,229 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:28,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 23:46:28,230 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:28,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:28,230 INFO L85 PathProgramCache]: Analyzing trace with hash -672116074, now seen corresponding path program 1 times [2022-02-20 23:46:28,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:28,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570052942] [2022-02-20 23:46:28,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:28,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:28,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {31647#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {31647#true} is VALID [2022-02-20 23:46:28,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {31647#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {31647#true} is VALID [2022-02-20 23:46:28,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {31647#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {31647#true} is VALID [2022-02-20 23:46:28,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {31647#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {31647#true} is VALID [2022-02-20 23:46:28,285 INFO L290 TraceCheckUtils]: 4: Hoare triple {31647#true} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {31647#true} is VALID [2022-02-20 23:46:28,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {31647#true} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {31647#true} is VALID [2022-02-20 23:46:28,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {31647#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {31647#true} is VALID [2022-02-20 23:46:28,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {31647#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {31647#true} is VALID [2022-02-20 23:46:28,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {31647#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {31649#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:28,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {31649#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {31649#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:28,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {31649#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {31649#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:28,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {31649#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {31649#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:28,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {31649#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {31650#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} is VALID [2022-02-20 23:46:28,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {31650#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {31650#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} is VALID [2022-02-20 23:46:28,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {31650#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {31650#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} is VALID [2022-02-20 23:46:28,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {31650#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {31651#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} is VALID [2022-02-20 23:46:28,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {31651#(= |ULTIMATE.start_main_~list~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {31652#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:46:28,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {31652#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {31653#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} is VALID [2022-02-20 23:46:28,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {31653#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L560 {31653#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} is VALID [2022-02-20 23:46:28,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {31653#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L560-1 {31653#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} is VALID [2022-02-20 23:46:28,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {31653#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {31653#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} is VALID [2022-02-20 23:46:28,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {31653#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} havoc main_~node~1#1.base, main_~node~1#1.offset; {31653#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} is VALID [2022-02-20 23:46:28,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {31653#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {31654#(not (= |ULTIMATE.start_main_#t~mem8#1.base| 0))} is VALID [2022-02-20 23:46:28,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {31654#(not (= |ULTIMATE.start_main_#t~mem8#1.base| 0))} assume main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~node~1#1.base, main_~node~1#1.offset := 0, 0; {31648#false} is VALID [2022-02-20 23:46:28,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {31648#false} assume !(main_~node~1#1.base != 0 || main_~node~1#1.offset != 0); {31648#false} is VALID [2022-02-20 23:46:28,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {31648#false} call ULTIMATE.dealloc(main_~#iter~0#1.base, main_~#iter~0#1.offset);havoc main_~#iter~0#1.base, main_~#iter~0#1.offset;main_~list~1#1.base, main_~list~1#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {31648#false} is VALID [2022-02-20 23:46:28,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {31648#false} main_#t~short23#1 := main_~list~1#1.base != 0 || main_~list~1#1.offset != 0; {31648#false} is VALID [2022-02-20 23:46:28,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {31648#false} assume main_#t~short23#1; {31648#false} is VALID [2022-02-20 23:46:28,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {31648#false} assume !(1 == #valid[main_~list~1#1.base]); {31648#false} is VALID [2022-02-20 23:46:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:28,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:28,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570052942] [2022-02-20 23:46:28,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570052942] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:28,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:28,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:46:28,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732943421] [2022-02-20 23:46:28,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:28,301 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:46:28,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:28,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:28,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:28,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:46:28,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:28,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:46:28,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:28,317 INFO L87 Difference]: Start difference. First operand 243 states and 272 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:29,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:29,104 INFO L93 Difference]: Finished difference Result 265 states and 296 transitions. [2022-02-20 23:46:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:46:29,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:46:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 286 transitions. [2022-02-20 23:46:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 286 transitions. [2022-02-20 23:46:29,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 286 transitions. [2022-02-20 23:46:29,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:29,285 INFO L225 Difference]: With dead ends: 265 [2022-02-20 23:46:29,286 INFO L226 Difference]: Without dead ends: 265 [2022-02-20 23:46:29,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:46:29,286 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 725 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:29,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [725 Valid, 934 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-02-20 23:46:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 243. [2022-02-20 23:46:29,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:29,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 states. Second operand has 243 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:29,290 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand has 243 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:29,291 INFO L87 Difference]: Start difference. First operand 265 states. Second operand has 243 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:29,294 INFO L93 Difference]: Finished difference Result 265 states and 296 transitions. [2022-02-20 23:46:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 296 transitions. [2022-02-20 23:46:29,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:29,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:29,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 265 states. [2022-02-20 23:46:29,295 INFO L87 Difference]: Start difference. First operand has 243 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 265 states. [2022-02-20 23:46:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:29,298 INFO L93 Difference]: Finished difference Result 265 states and 296 transitions. [2022-02-20 23:46:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 296 transitions. [2022-02-20 23:46:29,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:29,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:29,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:29,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 271 transitions. [2022-02-20 23:46:29,302 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 271 transitions. Word has length 29 [2022-02-20 23:46:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:29,303 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 271 transitions. [2022-02-20 23:46:29,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2022-02-20 23:46:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:46:29,304 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:29,304 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:29,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:46:29,304 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash 102015914, now seen corresponding path program 1 times [2022-02-20 23:46:29,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:29,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673860467] [2022-02-20 23:46:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:29,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:29,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {32708#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {32708#true} is VALID [2022-02-20 23:46:29,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {32708#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {32708#true} is VALID [2022-02-20 23:46:29,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {32708#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {32708#true} is VALID [2022-02-20 23:46:29,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {32708#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {32708#true} is VALID [2022-02-20 23:46:29,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {32708#true} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {32708#true} is VALID [2022-02-20 23:46:29,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {32708#true} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {32708#true} is VALID [2022-02-20 23:46:29,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {32708#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {32708#true} is VALID [2022-02-20 23:46:29,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {32708#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {32708#true} is VALID [2022-02-20 23:46:29,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {32708#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {32708#true} is VALID [2022-02-20 23:46:29,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {32708#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {32708#true} is VALID [2022-02-20 23:46:29,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {32708#true} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {32708#true} is VALID [2022-02-20 23:46:29,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {32708#true} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {32708#true} is VALID [2022-02-20 23:46:29,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {32708#true} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {32708#true} is VALID [2022-02-20 23:46:29,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {32708#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {32708#true} is VALID [2022-02-20 23:46:29,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {32708#true} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {32708#true} is VALID [2022-02-20 23:46:29,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {32708#true} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {32708#true} is VALID [2022-02-20 23:46:29,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {32708#true} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {32710#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|)} is VALID [2022-02-20 23:46:29,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {32710#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|)} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {32710#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|)} is VALID [2022-02-20 23:46:29,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {32710#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L560 {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:29,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} SUMMARY for call write~$Pointer$(main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L560-1 {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:29,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:29,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} havoc main_~node~1#1.base, main_~node~1#1.offset; {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:29,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:29,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} assume !(main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:29,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L567 {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:29,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} main_~current~0#1.base, main_~current~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:29,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~current~0#1.base, 4 + main_~current~0#1.offset, 4); srcloc: L568 {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:29,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L568-1 {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:29,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} assume !(main_#t~mem10#1.base != 0 || main_#t~mem10#1.offset != 0);havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:29,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {32711#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L571 {32712#(= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)} is VALID [2022-02-20 23:46:29,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {32712#(= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)} assume !(1 == #valid[main_#t~mem11#1.base]); {32709#false} is VALID [2022-02-20 23:46:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:46:29,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:29,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673860467] [2022-02-20 23:46:29,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673860467] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:29,364 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:29,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:29,365 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996840205] [2022-02-20 23:46:29,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:29,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 23:46:29,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:29,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:29,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:29,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:29,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:29,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:29,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:29,383 INFO L87 Difference]: Start difference. First operand 243 states and 271 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:29,966 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2022-02-20 23:46:29,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:46:29,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 23:46:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 278 transitions. [2022-02-20 23:46:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 278 transitions. [2022-02-20 23:46:29,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 278 transitions. [2022-02-20 23:46:30,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:30,131 INFO L225 Difference]: With dead ends: 259 [2022-02-20 23:46:30,131 INFO L226 Difference]: Without dead ends: 259 [2022-02-20 23:46:30,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:30,131 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 51 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:30,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 673 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:30,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-02-20 23:46:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 242. [2022-02-20 23:46:30,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:30,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 242 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:30,134 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 242 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:30,134 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 242 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:30,137 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2022-02-20 23:46:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2022-02-20 23:46:30,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:30,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:30,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 259 states. [2022-02-20 23:46:30,138 INFO L87 Difference]: Start difference. First operand has 242 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 259 states. [2022-02-20 23:46:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:30,141 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2022-02-20 23:46:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2022-02-20 23:46:30,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:30,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:30,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:30,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2022-02-20 23:46:30,144 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 31 [2022-02-20 23:46:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:30,145 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2022-02-20 23:46:30,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2022-02-20 23:46:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:46:30,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:30,145 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:30,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-20 23:46:30,146 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash 102015915, now seen corresponding path program 1 times [2022-02-20 23:46:30,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:30,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508960372] [2022-02-20 23:46:30,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:30,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:30,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {33738#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {33738#true} is VALID [2022-02-20 23:46:30,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {33738#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {33738#true} is VALID [2022-02-20 23:46:30,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {33738#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {33738#true} is VALID [2022-02-20 23:46:30,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {33738#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {33738#true} is VALID [2022-02-20 23:46:30,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {33738#true} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {33738#true} is VALID [2022-02-20 23:46:30,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {33738#true} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {33738#true} is VALID [2022-02-20 23:46:30,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {33738#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {33738#true} is VALID [2022-02-20 23:46:30,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {33738#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {33738#true} is VALID [2022-02-20 23:46:30,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {33738#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {33740#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:46:30,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {33740#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {33740#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:46:30,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {33740#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {33741#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:30,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {33741#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {33741#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:30,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {33741#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {33742#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:30,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {33742#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {33742#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:30,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {33742#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {33742#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:30,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {33742#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {33743#(and (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:46:30,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {33743#(and (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {33744#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:46:30,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {33744#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {33744#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:46:30,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {33744#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L560 {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} is VALID [2022-02-20 23:46:30,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} SUMMARY for call write~$Pointer$(main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L560-1 {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} is VALID [2022-02-20 23:46:30,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} is VALID [2022-02-20 23:46:30,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} havoc main_~node~1#1.base, main_~node~1#1.offset; {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} is VALID [2022-02-20 23:46:30,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} is VALID [2022-02-20 23:46:30,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} assume !(main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} is VALID [2022-02-20 23:46:30,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L567 {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} is VALID [2022-02-20 23:46:30,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} main_~current~0#1.base, main_~current~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} is VALID [2022-02-20 23:46:30,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~current~0#1.base, 4 + main_~current~0#1.offset, 4); srcloc: L568 {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} is VALID [2022-02-20 23:46:30,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L568-1 {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} is VALID [2022-02-20 23:46:30,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} assume !(main_#t~mem10#1.base != 0 || main_#t~mem10#1.offset != 0);havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} is VALID [2022-02-20 23:46:30,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {33745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|))))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L571 {33746#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|)))} is VALID [2022-02-20 23:46:30,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {33746#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|)))} assume !(4 + (4 + main_#t~mem11#1.offset) <= #length[main_#t~mem11#1.base] && 0 <= 4 + main_#t~mem11#1.offset); {33739#false} is VALID [2022-02-20 23:46:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:30,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:30,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508960372] [2022-02-20 23:46:30,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508960372] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:30,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:30,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:46:30,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526672557] [2022-02-20 23:46:30,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:30,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 23:46:30,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:30,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:30,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:30,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:46:30,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:46:30,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:46:30,310 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:31,991 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2022-02-20 23:46:31,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:46:31,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 23:46:31,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 402 transitions. [2022-02-20 23:46:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 402 transitions. [2022-02-20 23:46:31,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 402 transitions. [2022-02-20 23:46:32,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:32,250 INFO L225 Difference]: With dead ends: 374 [2022-02-20 23:46:32,250 INFO L226 Difference]: Without dead ends: 374 [2022-02-20 23:46:32,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:46:32,250 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 542 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:32,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [542 Valid, 947 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:46:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-02-20 23:46:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 241. [2022-02-20 23:46:32,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:32,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 374 states. Second operand has 241 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:32,253 INFO L74 IsIncluded]: Start isIncluded. First operand 374 states. Second operand has 241 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:32,253 INFO L87 Difference]: Start difference. First operand 374 states. Second operand has 241 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:32,257 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2022-02-20 23:46:32,257 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 421 transitions. [2022-02-20 23:46:32,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:32,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:32,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 374 states. [2022-02-20 23:46:32,258 INFO L87 Difference]: Start difference. First operand has 241 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 374 states. [2022-02-20 23:46:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:32,263 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2022-02-20 23:46:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 421 transitions. [2022-02-20 23:46:32,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:32,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:32,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:32,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 269 transitions. [2022-02-20 23:46:32,266 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 269 transitions. Word has length 31 [2022-02-20 23:46:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:32,267 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 269 transitions. [2022-02-20 23:46:32,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2022-02-20 23:46:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:46:32,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:32,267 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:32,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-20 23:46:32,268 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:32,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1705778921, now seen corresponding path program 1 times [2022-02-20 23:46:32,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:32,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399012700] [2022-02-20 23:46:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:32,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:32,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {35125#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {35125#true} is VALID [2022-02-20 23:46:32,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {35125#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {35125#true} is VALID [2022-02-20 23:46:32,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {35125#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {35125#true} is VALID [2022-02-20 23:46:32,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {35125#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {35125#true} is VALID [2022-02-20 23:46:32,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {35125#true} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {35125#true} is VALID [2022-02-20 23:46:32,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {35125#true} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {35125#true} is VALID [2022-02-20 23:46:32,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {35125#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {35125#true} is VALID [2022-02-20 23:46:32,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {35125#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {35125#true} is VALID [2022-02-20 23:46:32,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {35125#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {35125#true} is VALID [2022-02-20 23:46:32,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {35125#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {35125#true} is VALID [2022-02-20 23:46:32,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {35125#true} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {35127#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:32,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {35127#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {35127#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:32,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {35127#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {35128#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:46:32,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {35128#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {35128#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:46:32,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {35128#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {35128#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:46:32,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {35128#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {35129#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {35129#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {35129#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {35129#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {35129#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {35129#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L560 {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L560-1 {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} havoc main_~node~1#1.base, main_~node~1#1.offset; {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} assume !(main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L567 {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} main_~current~0#1.base, main_~current~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~current~0#1.base, 4 + main_~current~0#1.offset, 4); srcloc: L568 {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L568-1 {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} assume main_#t~mem10#1.base != 0 || main_#t~mem10#1.offset != 0;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_~node~1#1.base, main_~node~1#1.offset := main_~current~0#1.base, main_~current~0#1.offset; {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} assume !(main_~node~1#1.base != 0 || main_~node~1#1.offset != 0); {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:32,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {35130#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)))} call ULTIMATE.dealloc(main_~#iter~0#1.base, main_~#iter~0#1.offset);havoc main_~#iter~0#1.base, main_~#iter~0#1.offset;main_~list~1#1.base, main_~list~1#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {35131#(= (select |#valid| |ULTIMATE.start_main_~list~1#1.base|) 1)} is VALID [2022-02-20 23:46:32,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {35131#(= (select |#valid| |ULTIMATE.start_main_~list~1#1.base|) 1)} main_#t~short23#1 := main_~list~1#1.base != 0 || main_~list~1#1.offset != 0; {35131#(= (select |#valid| |ULTIMATE.start_main_~list~1#1.base|) 1)} is VALID [2022-02-20 23:46:32,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {35131#(= (select |#valid| |ULTIMATE.start_main_~list~1#1.base|) 1)} assume main_#t~short23#1; {35131#(= (select |#valid| |ULTIMATE.start_main_~list~1#1.base|) 1)} is VALID [2022-02-20 23:46:32,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {35131#(= (select |#valid| |ULTIMATE.start_main_~list~1#1.base|) 1)} assume !(1 == #valid[main_~list~1#1.base]); {35126#false} is VALID [2022-02-20 23:46:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:32,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:32,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399012700] [2022-02-20 23:46:32,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399012700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:32,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:32,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:46:32,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580792389] [2022-02-20 23:46:32,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:32,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-20 23:46:32,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:32,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:32,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:32,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:46:32,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:32,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:46:32,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:32,385 INFO L87 Difference]: Start difference. First operand 241 states and 269 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:33,410 INFO L93 Difference]: Finished difference Result 398 states and 443 transitions. [2022-02-20 23:46:33,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:46:33,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-20 23:46:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 446 transitions. [2022-02-20 23:46:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 446 transitions. [2022-02-20 23:46:33,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 446 transitions. [2022-02-20 23:46:33,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:33,682 INFO L225 Difference]: With dead ends: 398 [2022-02-20 23:46:33,683 INFO L226 Difference]: Without dead ends: 398 [2022-02-20 23:46:33,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:46:33,683 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 580 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:33,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 614 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:46:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-02-20 23:46:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 244. [2022-02-20 23:46:33,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:33,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 398 states. Second operand has 244 states, 173 states have (on average 1.5953757225433527) internal successors, (276), 243 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,686 INFO L74 IsIncluded]: Start isIncluded. First operand 398 states. Second operand has 244 states, 173 states have (on average 1.5953757225433527) internal successors, (276), 243 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,686 INFO L87 Difference]: Start difference. First operand 398 states. Second operand has 244 states, 173 states have (on average 1.5953757225433527) internal successors, (276), 243 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:33,692 INFO L93 Difference]: Finished difference Result 398 states and 443 transitions. [2022-02-20 23:46:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 443 transitions. [2022-02-20 23:46:33,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:33,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:33,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 173 states have (on average 1.5953757225433527) internal successors, (276), 243 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 398 states. [2022-02-20 23:46:33,693 INFO L87 Difference]: Start difference. First operand has 244 states, 173 states have (on average 1.5953757225433527) internal successors, (276), 243 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 398 states. [2022-02-20 23:46:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:33,698 INFO L93 Difference]: Finished difference Result 398 states and 443 transitions. [2022-02-20 23:46:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 443 transitions. [2022-02-20 23:46:33,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:33,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:33,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:33,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 173 states have (on average 1.5953757225433527) internal successors, (276), 243 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 276 transitions. [2022-02-20 23:46:33,702 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 276 transitions. Word has length 34 [2022-02-20 23:46:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:33,702 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 276 transitions. [2022-02-20 23:46:33,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 276 transitions. [2022-02-20 23:46:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:46:33,703 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:33,703 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:33,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-20 23:46:33,703 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:33,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:33,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1705778920, now seen corresponding path program 1 times [2022-02-20 23:46:33,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:33,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359224593] [2022-02-20 23:46:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:33,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:33,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {36579#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {36579#true} is VALID [2022-02-20 23:46:33,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {36579#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {36579#true} is VALID [2022-02-20 23:46:33,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {36579#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {36579#true} is VALID [2022-02-20 23:46:33,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {36579#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {36579#true} is VALID [2022-02-20 23:46:33,798 INFO L290 TraceCheckUtils]: 4: Hoare triple {36579#true} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {36579#true} is VALID [2022-02-20 23:46:33,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {36579#true} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {36579#true} is VALID [2022-02-20 23:46:33,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {36579#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {36579#true} is VALID [2022-02-20 23:46:33,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {36579#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {36579#true} is VALID [2022-02-20 23:46:33,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {36579#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {36581#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:46:33,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {36581#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {36581#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:46:33,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {36581#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {36582#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:33,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {36582#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {36582#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:33,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {36582#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {36583#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} is VALID [2022-02-20 23:46:33,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {36583#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {36583#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} is VALID [2022-02-20 23:46:33,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {36583#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {36583#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} is VALID [2022-02-20 23:46:33,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {36583#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {36584#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:46:33,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {36584#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {36584#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:46:33,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {36584#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {36584#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:46:33,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {36584#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L560 {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:33,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} SUMMARY for call write~$Pointer$(main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L560-1 {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:33,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:33,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} havoc main_~node~1#1.base, main_~node~1#1.offset; {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:33,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:33,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} assume !(main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:33,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L567 {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:33,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} main_~current~0#1.base, main_~current~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:33,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~current~0#1.base, 4 + main_~current~0#1.offset, 4); srcloc: L568 {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:33,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L568-1 {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:33,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} assume main_#t~mem10#1.base != 0 || main_#t~mem10#1.offset != 0;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_~node~1#1.base, main_~node~1#1.offset := main_~current~0#1.base, main_~current~0#1.offset; {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:33,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} assume !(main_~node~1#1.base != 0 || main_~node~1#1.offset != 0); {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:46:33,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {36585#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} call ULTIMATE.dealloc(main_~#iter~0#1.base, main_~#iter~0#1.offset);havoc main_~#iter~0#1.base, main_~#iter~0#1.offset;main_~list~1#1.base, main_~list~1#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {36586#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~list~1#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:46:33,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {36586#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~list~1#1.base|) (- 8)) 0))} main_#t~short23#1 := main_~list~1#1.base != 0 || main_~list~1#1.offset != 0; {36586#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~list~1#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:46:33,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {36586#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~list~1#1.base|) (- 8)) 0))} assume main_#t~short23#1; {36586#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~list~1#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:46:33,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {36586#(and (= |ULTIMATE.start_main_~list~1#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~list~1#1.base|) (- 8)) 0))} assume !(4 + (4 + main_~list~1#1.offset) <= #length[main_~list~1#1.base] && 0 <= 4 + main_~list~1#1.offset); {36580#false} is VALID [2022-02-20 23:46:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:33,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:33,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359224593] [2022-02-20 23:46:33,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359224593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:33,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:33,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:46:33,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547762471] [2022-02-20 23:46:33,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:33,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-20 23:46:33,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:33,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:33,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:46:33,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:33,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:46:33,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:33,847 INFO L87 Difference]: Start difference. First operand 244 states and 276 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:35,178 INFO L93 Difference]: Finished difference Result 496 states and 560 transitions. [2022-02-20 23:46:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:46:35,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-20 23:46:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 535 transitions. [2022-02-20 23:46:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 535 transitions. [2022-02-20 23:46:35,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 535 transitions. [2022-02-20 23:46:35,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:35,519 INFO L225 Difference]: With dead ends: 496 [2022-02-20 23:46:35,520 INFO L226 Difference]: Without dead ends: 496 [2022-02-20 23:46:35,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:46:35,520 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 838 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:35,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [838 Valid, 655 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:46:35,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-02-20 23:46:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 308. [2022-02-20 23:46:35,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:35,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 496 states. Second operand has 308 states, 237 states have (on average 1.5738396624472575) internal successors, (373), 307 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,524 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand has 308 states, 237 states have (on average 1.5738396624472575) internal successors, (373), 307 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,524 INFO L87 Difference]: Start difference. First operand 496 states. Second operand has 308 states, 237 states have (on average 1.5738396624472575) internal successors, (373), 307 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:35,532 INFO L93 Difference]: Finished difference Result 496 states and 560 transitions. [2022-02-20 23:46:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 560 transitions. [2022-02-20 23:46:35,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:35,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:35,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 308 states, 237 states have (on average 1.5738396624472575) internal successors, (373), 307 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 496 states. [2022-02-20 23:46:35,533 INFO L87 Difference]: Start difference. First operand has 308 states, 237 states have (on average 1.5738396624472575) internal successors, (373), 307 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 496 states. [2022-02-20 23:46:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:35,541 INFO L93 Difference]: Finished difference Result 496 states and 560 transitions. [2022-02-20 23:46:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 560 transitions. [2022-02-20 23:46:35,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:35,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:35,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:35,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 237 states have (on average 1.5738396624472575) internal successors, (373), 307 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 373 transitions. [2022-02-20 23:46:35,545 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 373 transitions. Word has length 34 [2022-02-20 23:46:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:35,546 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 373 transitions. [2022-02-20 23:46:35,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 373 transitions. [2022-02-20 23:46:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:46:35,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:35,546 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:35,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-20 23:46:35,547 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:35,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1332799064, now seen corresponding path program 1 times [2022-02-20 23:46:35,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:35,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179004772] [2022-02-20 23:46:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:35,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:35,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {38400#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {38400#true} is VALID [2022-02-20 23:46:35,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {38400#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {38400#true} is VALID [2022-02-20 23:46:35,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {38400#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {38400#true} is VALID [2022-02-20 23:46:35,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {38400#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {38402#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:35,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {38402#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|))} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {38402#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:35,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {38402#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {38403#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1))} is VALID [2022-02-20 23:46:35,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {38403#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {38403#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1))} is VALID [2022-02-20 23:46:35,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {38403#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1))} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {38403#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1))} is VALID [2022-02-20 23:46:35,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {38403#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) 1))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {38404#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~0#1.base|)) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:46:35,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {38404#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~0#1.base|)) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {38404#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~0#1.base|)) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:46:35,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {38404#(and (= |ULTIMATE.start_main_~node~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~0#1.base|)) (<= (+ |ULTIMATE.start_main_~node~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~node~0#1.base|) (+ |ULTIMATE.start_main_~node~0#1.offset| 4)) 0))} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {38405#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 4) 0) (not (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:35,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {38405#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 4) 0) (not (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {38406#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:35,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {38406#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {38407#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 23:46:35,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {38407#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {38407#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 23:46:35,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {38407#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {38407#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 23:46:35,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {38407#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {38408#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 4) 0))} is VALID [2022-02-20 23:46:35,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {38408#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 4) 0))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {38409#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 4) 0))} is VALID [2022-02-20 23:46:35,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {38409#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 4) 0))} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {38409#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 4) 0))} is VALID [2022-02-20 23:46:35,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {38409#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 4) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L560 {38410#(and (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem7#1.base|) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem7#1.base|) 4) 0) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0))} is VALID [2022-02-20 23:46:35,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {38410#(and (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem7#1.base|) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem7#1.base|) 4) 0) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L560-1 {38411#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0))} is VALID [2022-02-20 23:46:35,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {38411#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0))} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {38411#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0))} is VALID [2022-02-20 23:46:35,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {38411#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0))} havoc main_~node~1#1.base, main_~node~1#1.offset; {38411#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0))} is VALID [2022-02-20 23:46:35,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {38411#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {38411#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0))} is VALID [2022-02-20 23:46:35,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {38411#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0))} assume !(main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {38411#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0))} is VALID [2022-02-20 23:46:35,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {38411#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) 4) 0))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L567 {38412#(and (= |ULTIMATE.start_main_#t~mem9#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem9#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem9#1.base|) 4) 0))} is VALID [2022-02-20 23:46:35,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {38412#(and (= |ULTIMATE.start_main_#t~mem9#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem9#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem9#1.base|) 4) 0))} main_~current~0#1.base, main_~current~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {38413#(and (= |ULTIMATE.start_main_~current~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~current~0#1.base|) (+ |ULTIMATE.start_main_~current~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~current~0#1.base|) (+ |ULTIMATE.start_main_~current~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:46:35,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {38413#(and (= |ULTIMATE.start_main_~current~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~current~0#1.base|) (+ |ULTIMATE.start_main_~current~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~current~0#1.base|) (+ |ULTIMATE.start_main_~current~0#1.offset| 4)) 0))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~current~0#1.base, 4 + main_~current~0#1.offset, 4); srcloc: L568 {38414#(and (= |ULTIMATE.start_main_#t~mem10#1.offset| 0) (= |ULTIMATE.start_main_~current~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem10#1.base| 0))} is VALID [2022-02-20 23:46:35,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {38414#(and (= |ULTIMATE.start_main_#t~mem10#1.offset| 0) (= |ULTIMATE.start_main_~current~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem10#1.base| 0))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L568-1 {38414#(and (= |ULTIMATE.start_main_#t~mem10#1.offset| 0) (= |ULTIMATE.start_main_~current~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem10#1.base| 0))} is VALID [2022-02-20 23:46:35,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {38414#(and (= |ULTIMATE.start_main_#t~mem10#1.offset| 0) (= |ULTIMATE.start_main_~current~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem10#1.base| 0))} assume main_#t~mem10#1.base != 0 || main_#t~mem10#1.offset != 0;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_~node~1#1.base, main_~node~1#1.offset := main_~current~0#1.base, main_~current~0#1.offset; {38401#false} is VALID [2022-02-20 23:46:35,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {38401#false} assume !!(main_~node~1#1.base != 0 || main_~node~1#1.offset != 0); {38401#false} is VALID [2022-02-20 23:46:35,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {38401#false} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L580 {38401#false} is VALID [2022-02-20 23:46:35,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {38401#false} assume !(main_#t~mem15#1.base == 0 && main_#t~mem15#1.offset == 0);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {38401#false} is VALID [2022-02-20 23:46:35,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {38401#false} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L583 {38401#false} is VALID [2022-02-20 23:46:35,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {38401#false} main_~current~1#1.base, main_~current~1#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {38401#false} is VALID [2022-02-20 23:46:35,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {38401#false} assume !(1 == #valid[main_~current~1#1.base]); {38401#false} is VALID [2022-02-20 23:46:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:35,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:35,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179004772] [2022-02-20 23:46:35,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179004772] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:35,874 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:35,874 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 23:46:35,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138296262] [2022-02-20 23:46:35,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:35,874 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-20 23:46:35,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:35,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:35,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:46:35,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:35,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:46:35,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:46:35,904 INFO L87 Difference]: Start difference. First operand 308 states and 373 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:39,011 INFO L93 Difference]: Finished difference Result 310 states and 374 transitions. [2022-02-20 23:46:39,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:46:39,011 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-20 23:46:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 259 transitions. [2022-02-20 23:46:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 259 transitions. [2022-02-20 23:46:39,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 259 transitions. [2022-02-20 23:46:39,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:39,206 INFO L225 Difference]: With dead ends: 310 [2022-02-20 23:46:39,206 INFO L226 Difference]: Without dead ends: 310 [2022-02-20 23:46:39,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2022-02-20 23:46:39,207 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 334 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:39,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 1847 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 23:46:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-02-20 23:46:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2022-02-20 23:46:39,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:39,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand has 308 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 307 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:39,210 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand has 308 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 307 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:39,210 INFO L87 Difference]: Start difference. First operand 310 states. Second operand has 308 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 307 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:39,214 INFO L93 Difference]: Finished difference Result 310 states and 374 transitions. [2022-02-20 23:46:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 374 transitions. [2022-02-20 23:46:39,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:39,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:39,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 308 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 307 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 310 states. [2022-02-20 23:46:39,215 INFO L87 Difference]: Start difference. First operand has 308 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 307 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 310 states. [2022-02-20 23:46:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:39,218 INFO L93 Difference]: Finished difference Result 310 states and 374 transitions. [2022-02-20 23:46:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 374 transitions. [2022-02-20 23:46:39,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:39,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:39,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:39,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 307 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 372 transitions. [2022-02-20 23:46:39,223 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 372 transitions. Word has length 35 [2022-02-20 23:46:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:39,223 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 372 transitions. [2022-02-20 23:46:39,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 372 transitions. [2022-02-20 23:46:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:46:39,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:39,223 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:39,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-20 23:46:39,223 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:39,224 INFO L85 PathProgramCache]: Analyzing trace with hash -561839822, now seen corresponding path program 1 times [2022-02-20 23:46:39,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:39,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958600569] [2022-02-20 23:46:39,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:39,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {39684#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {39684#true} is VALID [2022-02-20 23:46:39,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {39684#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:39,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:39,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {39687#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:39,474 INFO L290 TraceCheckUtils]: 4: Hoare triple {39687#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {39687#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:39,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {39687#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {39687#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:39,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {39687#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {39687#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:39,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {39687#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {39687#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:39,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {39687#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {39688#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:39,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {39688#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {39688#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:39,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {39688#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {39689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:39,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {39689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {39690#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) 0))} is VALID [2022-02-20 23:46:39,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {39690#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {39691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} is VALID [2022-02-20 23:46:39,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {39691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {39691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} is VALID [2022-02-20 23:46:39,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {39691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {39691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} is VALID [2022-02-20 23:46:39,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {39691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {39692#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) 4) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) 4) 0))} is VALID [2022-02-20 23:46:39,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {39692#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) 4) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) 4) 0))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {39693#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) 4) 0))} is VALID [2022-02-20 23:46:39,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {39693#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) 4) 0))} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {39693#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) 4) 0))} is VALID [2022-02-20 23:46:39,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {39693#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~list~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) 4) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L560 {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:39,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L560-1 {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:39,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:39,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} havoc main_~node~1#1.base, main_~node~1#1.offset; {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:39,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:39,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} assume !(main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:39,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L567 {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:39,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} main_~current~0#1.base, main_~current~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:39,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~current~0#1.base, 4 + main_~current~0#1.offset, 4); srcloc: L568 {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:39,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L568-1 {39695#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} is VALID [2022-02-20 23:46:39,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {39695#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} assume !(main_#t~mem10#1.base != 0 || main_#t~mem10#1.offset != 0);havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {39695#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} is VALID [2022-02-20 23:46:39,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {39695#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L571 {39696#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem11#1.base|) (+ |ULTIMATE.start_main_#t~mem11#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem11#1.base|) (+ |ULTIMATE.start_main_#t~mem11#1.offset| 4)) 0) (= |ULTIMATE.start_main_#t~mem11#1.offset| 0))} is VALID [2022-02-20 23:46:39,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {39696#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem11#1.base|) (+ |ULTIMATE.start_main_#t~mem11#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem11#1.base|) (+ |ULTIMATE.start_main_#t~mem11#1.offset| 4)) 0) (= |ULTIMATE.start_main_#t~mem11#1.offset| 0))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); srcloc: L571-1 {39697#(and (= |ULTIMATE.start_main_#t~mem12#1.base| 0) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} is VALID [2022-02-20 23:46:39,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {39697#(and (= |ULTIMATE.start_main_#t~mem12#1.base| 0) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L571-2 {39697#(and (= |ULTIMATE.start_main_#t~mem12#1.base| 0) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} is VALID [2022-02-20 23:46:39,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {39697#(and (= |ULTIMATE.start_main_#t~mem12#1.base| 0) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} assume main_#t~mem12#1.base != 0 || main_#t~mem12#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset; {39685#false} is VALID [2022-02-20 23:46:39,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {39685#false} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L572 {39685#false} is VALID [2022-02-20 23:46:39,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {39685#false} assume !(1 == #valid[main_#t~mem13#1.base]); {39685#false} is VALID [2022-02-20 23:46:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:39,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:39,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958600569] [2022-02-20 23:46:39,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958600569] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:46:39,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585402718] [2022-02-20 23:46:39,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:39,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:39,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:39,490 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:46:39,490 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:46:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:39,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjunts are in the unsatisfiable core [2022-02-20 23:46:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:39,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:39,779 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:46:39,815 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 13 treesize of output 9 [2022-02-20 23:46:39,820 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 13 treesize of output 9 [2022-02-20 23:46:39,882 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:46:39,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:46:39,934 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 18 [2022-02-20 23:46:39,938 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 23 treesize of output 22 [2022-02-20 23:46:40,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:40,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 32 treesize of output 34 [2022-02-20 23:46:40,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:40,045 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-02-20 23:46:40,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-02-20 23:46:40,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:40,208 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-02-20 23:46:40,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-02-20 23:46:40,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:40,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 32 treesize of output 34 [2022-02-20 23:46:40,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:46:40,443 INFO L356 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-02-20 23:46:40,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-02-20 23:46:40,488 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:40,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-02-20 23:46:40,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {39684#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {39684#true} is VALID [2022-02-20 23:46:40,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {39684#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~short34#1, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:40,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:40,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:40,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~node~0#1.base == 0 && main_~node~0#1.offset == 0); {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:40,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~node~0#1.base, 4 + main_~node~0#1.offset, 4); srcloc: L543-2 {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:40,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:40,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} SUMMARY for call write~int(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4); srcloc: L546 {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:40,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {39686#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {39689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:40,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {39689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {39689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:40,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {39689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L548-2 {39689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:40,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {39689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L550 {39690#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) 0))} is VALID [2022-02-20 23:46:40,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {39690#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {39691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} is VALID [2022-02-20 23:46:40,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {39691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {39691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} is VALID [2022-02-20 23:46:40,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {39691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {39691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} is VALID [2022-02-20 23:46:40,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {39691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {39692#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) 4) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) 4) 0))} is VALID [2022-02-20 23:46:40,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {39692#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) 4) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~#iter~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) 4) 0))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L559 {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} assume main_~list~0#1.base != 0 || main_~list~0#1.offset != 0; {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L560 {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L560-1 {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} havoc main_~node~1#1.base, main_~node~1#1.offset; {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L564 {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} assume !(main_#t~mem8#1.base == 0 && main_#t~mem8#1.offset == 0);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L567 {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} main_~current~0#1.base, main_~current~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~current~0#1.base, 4 + main_~current~0#1.offset, 4); srcloc: L568 {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~#iter~0#1.base, 4 + main_~#iter~0#1.offset, 4); srcloc: L568-1 {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} assume !(main_#t~mem10#1.base != 0 || main_#t~mem10#1.offset != 0);havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} is VALID [2022-02-20 23:46:40,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {39694#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L571 {39788#(exists ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|ULTIMATE.start_main_~#iter~0#1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.base|) (= |ULTIMATE.start_main_#t~mem11#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|))))} is VALID [2022-02-20 23:46:40,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {39788#(exists ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|ULTIMATE.start_main_~#iter~0#1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.base|) (= |ULTIMATE.start_main_#t~mem11#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset|) |ULTIMATE.start_main_~#iter~0#1.base|))))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); srcloc: L571-1 {39697#(and (= |ULTIMATE.start_main_#t~mem12#1.base| 0) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} is VALID [2022-02-20 23:46:40,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {39697#(and (= |ULTIMATE.start_main_#t~mem12#1.base| 0) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L571-2 {39697#(and (= |ULTIMATE.start_main_#t~mem12#1.base| 0) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} is VALID [2022-02-20 23:46:40,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {39697#(and (= |ULTIMATE.start_main_#t~mem12#1.base| 0) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} assume main_#t~mem12#1.base != 0 || main_#t~mem12#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset; {39685#false} is VALID [2022-02-20 23:46:40,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {39685#false} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~#iter~0#1.base, main_~#iter~0#1.offset, 4); srcloc: L572 {39685#false} is VALID [2022-02-20 23:46:40,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {39685#false} assume !(1 == #valid[main_#t~mem13#1.base]); {39685#false} is VALID [2022-02-20 23:46:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:40,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:42,344 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_767 Int) (v_ArrVal_765 Int)) (= 0 (let ((.cse1 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) (select (let ((.cse0 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse1 v_ArrVal_767))) (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#iter~0#1.base| .cse0) (select .cse0 |ULTIMATE.start_main_~#iter~0#1.offset|))) (+ (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1 v_ArrVal_765) |ULTIMATE.start_main_~#iter~0#1.offset|) 4))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_767 Int) (v_ArrVal_765 Int)) (= (let ((.cse3 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) (let ((.cse2 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) .cse3 v_ArrVal_765))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#iter~0#1.base| .cse2) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3 v_ArrVal_767) |ULTIMATE.start_main_~#iter~0#1.offset|)) (+ (select .cse2 |ULTIMATE.start_main_~#iter~0#1.offset|) 4)))) 0))) is different from false [2022-02-20 23:46:47,353 INFO L356 Elim1Store]: treesize reduction 112, result has 22.2 percent of original size [2022-02-20 23:46:47,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 7765 treesize of output 6144 [2022-02-20 23:46:47,389 INFO L356 Elim1Store]: treesize reduction 76, result has 20.8 percent of original size [2022-02-20 23:46:47,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 7594 treesize of output 5982 [2022-02-20 23:46:47,413 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:46:47,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 5982 treesize of output 5672 [2022-02-20 23:46:47,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:46:47,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 5672 treesize of output 5362 [2022-02-20 23:46:47,592 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 23:46:47,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:47,807 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,SelfDestructingSolverStorable28 [2022-02-20 23:46:47,808 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) 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:46:47,812 INFO L158 Benchmark]: Toolchain (without parser) took 44509.24ms. Allocated memory was 123.7MB in the beginning and 239.1MB in the end (delta: 115.3MB). Free memory was 94.6MB in the beginning and 199.0MB in the end (delta: -104.4MB). Peak memory consumption was 143.4MB. Max. memory is 16.1GB. [2022-02-20 23:46:47,812 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 123.7MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:46:47,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.63ms. Allocated memory was 123.7MB in the beginning and 165.7MB in the end (delta: 41.9MB). Free memory was 94.4MB in the beginning and 128.1MB in the end (delta: -33.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:46:47,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.85ms. Allocated memory is still 165.7MB. Free memory was 128.1MB in the beginning and 124.2MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:46:47,812 INFO L158 Benchmark]: Boogie Preprocessor took 29.50ms. Allocated memory is still 165.7MB. Free memory was 124.2MB in the beginning and 120.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:46:47,812 INFO L158 Benchmark]: RCFGBuilder took 831.58ms. Allocated memory is still 165.7MB. Free memory was 120.2MB in the beginning and 106.2MB in the end (delta: 14.0MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2022-02-20 23:46:47,812 INFO L158 Benchmark]: TraceAbstraction took 43220.14ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 105.4MB in the beginning and 199.0MB in the end (delta: -93.6MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2022-02-20 23:46:47,813 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.16ms. Allocated memory is still 123.7MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.63ms. Allocated memory was 123.7MB in the beginning and 165.7MB in the end (delta: 41.9MB). Free memory was 94.4MB in the beginning and 128.1MB in the end (delta: -33.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.85ms. Allocated memory is still 165.7MB. Free memory was 128.1MB in the beginning and 124.2MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.50ms. Allocated memory is still 165.7MB. Free memory was 124.2MB in the beginning and 120.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 831.58ms. Allocated memory is still 165.7MB. Free memory was 120.2MB in the beginning and 106.2MB in the end (delta: 14.0MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * TraceAbstraction took 43220.14ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 105.4MB in the beginning and 199.0MB in the end (delta: -93.6MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:46:47,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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/memsafety/test-0521.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 aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:46:49,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:46:49,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:46:49,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:46:49,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:46:49,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:46:49,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:46:49,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:46:49,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:46:49,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:46:49,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:46:49,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:46:49,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:46:49,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:46:49,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:46:49,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:46:49,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:46:49,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:46:49,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:46:49,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:46:49,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:46:49,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:46:49,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:46:49,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:46:49,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:46:49,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:46:49,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:46:49,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:46:49,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:46:49,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:46:49,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:46:49,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:46:49,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:46:49,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:46:49,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:46:49,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:46:49,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:46:49,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:46:49,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:46:49,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:46:49,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:46:49,473 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:46:49,489 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:46:49,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:46:49,490 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:46:49,490 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:46:49,491 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:46:49,491 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:46:49,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:46:49,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:46:49,492 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:46:49,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:46:49,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:46:49,493 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:46:49,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:46:49,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:46:49,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:46:49,494 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:46:49,494 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:46:49,494 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:46:49,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:46:49,494 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:46:49,494 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:46:49,495 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:46:49,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:46:49,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:46:49,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:46:49,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:46:49,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:46:49,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:49,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:46:49,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:46:49,500 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:46:49,500 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:46:49,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:46:49,501 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 -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2022-02-20 23:46:49,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:46:49,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:46:49,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:46:49,758 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:46:49,758 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:46:49,759 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0521.i [2022-02-20 23:46:49,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/977e8d217/fbb365b0194c42478e18bf119eda7b95/FLAG1c91ca62e [2022-02-20 23:46:50,200 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:46:50,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2022-02-20 23:46:50,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/977e8d217/fbb365b0194c42478e18bf119eda7b95/FLAG1c91ca62e [2022-02-20 23:46:50,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/977e8d217/fbb365b0194c42478e18bf119eda7b95 [2022-02-20 23:46:50,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:46:50,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:46:50,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:50,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:46:50,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:46:50,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:50" (1/1) ... [2022-02-20 23:46:50,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa031ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:50, skipping insertion in model container [2022-02-20 23:46:50,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:50" (1/1) ... [2022-02-20 23:46:50,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:46:50,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:46:50,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:50,571 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:46:50,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:50,662 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:46:50,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:50 WrapperNode [2022-02-20 23:46:50,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:50,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:50,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:46:50,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:46:50,669 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:46:50" (1/1) ... [2022-02-20 23:46:50,696 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:46:50" (1/1) ... [2022-02-20 23:46:50,740 INFO L137 Inliner]: procedures = 128, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 298 [2022-02-20 23:46:50,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:50,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:46:50,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:46:50,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:46:50,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:50" (1/1) ... [2022-02-20 23:46:50,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:50" (1/1) ... [2022-02-20 23:46:50,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:50" (1/1) ... [2022-02-20 23:46:50,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:50" (1/1) ... [2022-02-20 23:46:50,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:50" (1/1) ... [2022-02-20 23:46:50,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:50" (1/1) ... [2022-02-20 23:46:50,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:50" (1/1) ... [2022-02-20 23:46:50,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:46:50,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:46:50,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:46:50,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:46:50,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:50" (1/1) ... [2022-02-20 23:46:50,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:50,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:50,825 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:46:50,836 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:46:50,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:46:50,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:46:50,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:46:50,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:46:50,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:46:50,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:46:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:46:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:46:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:46:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:46:50,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:46:50,993 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:46:50,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:46:51,701 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:46:51,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:46:51,710 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 23:46:51,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:51 BoogieIcfgContainer [2022-02-20 23:46:51,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:46:51,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:46:51,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:46:51,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:46:51,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:46:50" (1/3) ... [2022-02-20 23:46:51,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512ddabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:51, skipping insertion in model container [2022-02-20 23:46:51,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:50" (2/3) ... [2022-02-20 23:46:51,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512ddabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:51, skipping insertion in model container [2022-02-20 23:46:51,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:51" (3/3) ... [2022-02-20 23:46:51,719 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0521.i [2022-02-20 23:46:51,722 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:46:51,722 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2022-02-20 23:46:51,756 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:46:51,760 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:46:51,761 INFO L340 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2022-02-20 23:46:51,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 156 states have (on average 2.2115384615384617) internal successors, (345), 308 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:46:51,787 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:51,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:46:51,788 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash 28727526, now seen corresponding path program 1 times [2022-02-20 23:46:51,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:51,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099934960] [2022-02-20 23:46:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:51,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:51,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:51,802 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:46:51,815 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:46:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:51,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 23:46:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:51,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:51,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#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(12bv32, 2bv32); {312#true} is VALID [2022-02-20 23:46:51,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {312#true} is VALID [2022-02-20 23:46:51,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume !true; {313#false} is VALID [2022-02-20 23:46:51,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#false} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8bv32);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {313#false} is VALID [2022-02-20 23:46:51,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {313#false} assume !(1bv1 == #valid[main_~#iter~0#1.base]); {313#false} is VALID [2022-02-20 23:46:51,949 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:46:51,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:51,949 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:51,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099934960] [2022-02-20 23:46:51,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099934960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:51,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:51,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:51,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614256759] [2022-02-20 23:46:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:51,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:46:51,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:51,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:51,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:46:51,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:51,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:46:51,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:46:51,986 INFO L87 Difference]: Start difference. First operand has 309 states, 156 states have (on average 2.2115384615384617) internal successors, (345), 308 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,430 INFO L93 Difference]: Finished difference Result 309 states and 335 transitions. [2022-02-20 23:46:52,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:46:52,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:46:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 345 transitions. [2022-02-20 23:46:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 345 transitions. [2022-02-20 23:46:52,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 345 transitions. [2022-02-20 23:46:52,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 345 edges. 345 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:52,774 INFO L225 Difference]: With dead ends: 309 [2022-02-20 23:46:52,774 INFO L226 Difference]: Without dead ends: 307 [2022-02-20 23:46:52,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:46:52,777 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:52,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:52,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-02-20 23:46:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-02-20 23:46:52,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:52,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 307 states, 155 states have (on average 2.1483870967741936) internal successors, (333), 306 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,805 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 307 states, 155 states have (on average 2.1483870967741936) internal successors, (333), 306 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,805 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 307 states, 155 states have (on average 2.1483870967741936) internal successors, (333), 306 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,816 INFO L93 Difference]: Finished difference Result 307 states and 333 transitions. [2022-02-20 23:46:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 333 transitions. [2022-02-20 23:46:52,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:52,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:52,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 307 states, 155 states have (on average 2.1483870967741936) internal successors, (333), 306 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 307 states. [2022-02-20 23:46:52,819 INFO L87 Difference]: Start difference. First operand has 307 states, 155 states have (on average 2.1483870967741936) internal successors, (333), 306 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 307 states. [2022-02-20 23:46:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,828 INFO L93 Difference]: Finished difference Result 307 states and 333 transitions. [2022-02-20 23:46:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 333 transitions. [2022-02-20 23:46:52,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:52,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:52,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:52,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 155 states have (on average 2.1483870967741936) internal successors, (333), 306 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 333 transitions. [2022-02-20 23:46:52,849 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 333 transitions. Word has length 5 [2022-02-20 23:46:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:52,850 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 333 transitions. [2022-02-20 23:46:52,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 333 transitions. [2022-02-20 23:46:52,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:46:52,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:52,850 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:46:52,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:53,059 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:46:53,059 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:53,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:53,060 INFO L85 PathProgramCache]: Analyzing trace with hash 28698696, now seen corresponding path program 1 times [2022-02-20 23:46:53,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:53,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681262150] [2022-02-20 23:46:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:53,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:53,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:53,061 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:46:53,063 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:46:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:53,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:46:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:53,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:53,195 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:46:53,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {1558#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(12bv32, 2bv32); {1558#true} is VALID [2022-02-20 23:46:53,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {1558#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {1558#true} is VALID [2022-02-20 23:46:53,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {1558#true} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {1558#true} is VALID [2022-02-20 23:46:53,209 INFO L290 TraceCheckUtils]: 3: Hoare triple {1558#true} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8bv32);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {1572#(= (select |#valid| |ULTIMATE.start_main_~#iter~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:53,209 INFO L290 TraceCheckUtils]: 4: Hoare triple {1572#(= (select |#valid| |ULTIMATE.start_main_~#iter~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~#iter~0#1.base]); {1559#false} is VALID [2022-02-20 23:46:53,209 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:46:53,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:53,210 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:53,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681262150] [2022-02-20 23:46:53,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681262150] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:53,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:53,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:53,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125071297] [2022-02-20 23:46:53,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:53,226 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:46:53,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:53,226 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:53,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:53,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:53,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:53,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:53,232 INFO L87 Difference]: Start difference. First operand 307 states and 333 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,203 INFO L93 Difference]: Finished difference Result 291 states and 317 transitions. [2022-02-20 23:46:54,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:54,204 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:46:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:54,204 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2022-02-20 23:46:54,208 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2022-02-20 23:46:54,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 333 transitions. [2022-02-20 23:46:54,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:54,493 INFO L225 Difference]: With dead ends: 291 [2022-02-20 23:46:54,493 INFO L226 Difference]: Without dead ends: 291 [2022-02-20 23:46:54,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:54,494 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 77 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:54,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 396 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-02-20 23:46:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2022-02-20 23:46:54,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:54,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 291 states, 155 states have (on average 2.0451612903225804) internal successors, (317), 290 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,502 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 291 states, 155 states have (on average 2.0451612903225804) internal successors, (317), 290 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,502 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 291 states, 155 states have (on average 2.0451612903225804) internal successors, (317), 290 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,517 INFO L93 Difference]: Finished difference Result 291 states and 317 transitions. [2022-02-20 23:46:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 317 transitions. [2022-02-20 23:46:54,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 291 states, 155 states have (on average 2.0451612903225804) internal successors, (317), 290 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 291 states. [2022-02-20 23:46:54,523 INFO L87 Difference]: Start difference. First operand has 291 states, 155 states have (on average 2.0451612903225804) internal successors, (317), 290 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 291 states. [2022-02-20 23:46:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,529 INFO L93 Difference]: Finished difference Result 291 states and 317 transitions. [2022-02-20 23:46:54,529 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 317 transitions. [2022-02-20 23:46:54,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:54,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 155 states have (on average 2.0451612903225804) internal successors, (317), 290 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 317 transitions. [2022-02-20 23:46:54,535 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 317 transitions. Word has length 5 [2022-02-20 23:46:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:54,535 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 317 transitions. [2022-02-20 23:46:54,536 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 317 transitions. [2022-02-20 23:46:54,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:46:54,536 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:54,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:46:54,543 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:46:54,741 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:46:54,741 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:54,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash 28698697, now seen corresponding path program 1 times [2022-02-20 23:46:54,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:54,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582789115] [2022-02-20 23:46:54,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:54,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:54,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:54,744 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:46:54,745 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:46:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:54,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:46:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:54,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:54,815 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:46:54,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {2739#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(12bv32, 2bv32); {2739#true} is VALID [2022-02-20 23:46:54,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {2739#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {2739#true} is VALID [2022-02-20 23:46:54,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {2739#true} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {2739#true} is VALID [2022-02-20 23:46:54,823 INFO L290 TraceCheckUtils]: 3: Hoare triple {2739#true} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8bv32);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {2753#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~#iter~0#1.base|)) (= |ULTIMATE.start_main_~#iter~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:46:54,824 INFO L290 TraceCheckUtils]: 4: Hoare triple {2753#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~#iter~0#1.base|)) (= |ULTIMATE.start_main_~#iter~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~#iter~0#1.offset), #length[main_~#iter~0#1.base]) && ~bvule32(main_~#iter~0#1.offset, ~bvadd32(4bv32, main_~#iter~0#1.offset))) && ~bvule32(0bv32, main_~#iter~0#1.offset)); {2740#false} is VALID [2022-02-20 23:46:54,824 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:46:54,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:54,824 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:54,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582789115] [2022-02-20 23:46:54,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582789115] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:54,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:54,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:54,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672875548] [2022-02-20 23:46:54,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:54,825 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:46:54,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:54,826 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:54,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:54,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:54,831 INFO L87 Difference]: Start difference. First operand 291 states and 317 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:55,784 INFO L93 Difference]: Finished difference Result 275 states and 301 transitions. [2022-02-20 23:46:55,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:55,784 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:46:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:55,784 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-02-20 23:46:55,786 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-02-20 23:46:55,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 317 transitions. [2022-02-20 23:46:56,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:56,081 INFO L225 Difference]: With dead ends: 275 [2022-02-20 23:46:56,082 INFO L226 Difference]: Without dead ends: 275 [2022-02-20 23:46:56,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:56,082 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 61 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:56,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 405 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:46:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-02-20 23:46:56,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-02-20 23:46:56,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:56,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 275 states, 155 states have (on average 1.9419354838709677) internal successors, (301), 274 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,088 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 275 states, 155 states have (on average 1.9419354838709677) internal successors, (301), 274 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,088 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 275 states, 155 states have (on average 1.9419354838709677) internal successors, (301), 274 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:56,097 INFO L93 Difference]: Finished difference Result 275 states and 301 transitions. [2022-02-20 23:46:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2022-02-20 23:46:56,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:56,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:56,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 275 states, 155 states have (on average 1.9419354838709677) internal successors, (301), 274 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 275 states. [2022-02-20 23:46:56,099 INFO L87 Difference]: Start difference. First operand has 275 states, 155 states have (on average 1.9419354838709677) internal successors, (301), 274 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 275 states. [2022-02-20 23:46:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:56,104 INFO L93 Difference]: Finished difference Result 275 states and 301 transitions. [2022-02-20 23:46:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2022-02-20 23:46:56,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:56,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:56,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:56,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 155 states have (on average 1.9419354838709677) internal successors, (301), 274 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2022-02-20 23:46:56,110 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 5 [2022-02-20 23:46:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:56,111 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2022-02-20 23:46:56,111 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2022-02-20 23:46:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:46:56,111 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:56,111 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:46:56,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:56,317 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:46:56,318 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash 28699819, now seen corresponding path program 1 times [2022-02-20 23:46:56,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:56,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748093962] [2022-02-20 23:46:56,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:56,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:56,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:56,320 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:46:56,320 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:46:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:56,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:46:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:56,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:56,391 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:46:56,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {3856#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(12bv32, 2bv32); {3856#true} is VALID [2022-02-20 23:46:56,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {3856#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {3856#true} is VALID [2022-02-20 23:46:56,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {3856#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {3867#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:56,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {3867#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) (_ bv1 1))} assume !(main_~node~0#1.base == 0bv32 && main_~node~0#1.offset == 0bv32); {3867#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:56,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {3867#(= (select |#valid| |ULTIMATE.start_main_~node~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~node~0#1.base]); {3857#false} is VALID [2022-02-20 23:46:56,402 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:46:56,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:56,402 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:56,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748093962] [2022-02-20 23:46:56,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748093962] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:56,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:56,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:56,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652171295] [2022-02-20 23:46:56,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:56,409 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:46:56,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:56,409 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:56,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:56,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:56,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:56,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:56,414 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:57,481 INFO L93 Difference]: Finished difference Result 329 states and 364 transitions. [2022-02-20 23:46:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:57,482 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:46:57,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:57,482 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-02-20 23:46:57,484 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-02-20 23:46:57,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 366 transitions. [2022-02-20 23:46:57,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:57,798 INFO L225 Difference]: With dead ends: 329 [2022-02-20 23:46:57,798 INFO L226 Difference]: Without dead ends: 329 [2022-02-20 23:46:57,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:57,806 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 74 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:57,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 471 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-02-20 23:46:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 273. [2022-02-20 23:46:57,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:57,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 273 states, 155 states have (on average 1.929032258064516) internal successors, (299), 272 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,811 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 273 states, 155 states have (on average 1.929032258064516) internal successors, (299), 272 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,812 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 273 states, 155 states have (on average 1.929032258064516) internal successors, (299), 272 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:57,816 INFO L93 Difference]: Finished difference Result 329 states and 364 transitions. [2022-02-20 23:46:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 364 transitions. [2022-02-20 23:46:57,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:57,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:57,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 155 states have (on average 1.929032258064516) internal successors, (299), 272 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 329 states. [2022-02-20 23:46:57,817 INFO L87 Difference]: Start difference. First operand has 273 states, 155 states have (on average 1.929032258064516) internal successors, (299), 272 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 329 states. [2022-02-20 23:46:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:57,822 INFO L93 Difference]: Finished difference Result 329 states and 364 transitions. [2022-02-20 23:46:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 364 transitions. [2022-02-20 23:46:57,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:57,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:57,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:57,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 155 states have (on average 1.929032258064516) internal successors, (299), 272 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 299 transitions. [2022-02-20 23:46:57,827 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 299 transitions. Word has length 5 [2022-02-20 23:46:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:57,827 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 299 transitions. [2022-02-20 23:46:57,827 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 299 transitions. [2022-02-20 23:46:57,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:46:57,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:57,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:46:57,839 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:46:58,034 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:46:58,036 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:46:58,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash 28699820, now seen corresponding path program 1 times [2022-02-20 23:46:58,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:58,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343675635] [2022-02-20 23:46:58,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:58,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:58,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:58,040 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:46:58,041 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:46:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:58,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:46:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:58,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:58,114 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:46:58,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {5133#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(12bv32, 2bv32); {5133#true} is VALID [2022-02-20 23:46:58,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {5133#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {5133#true} is VALID [2022-02-20 23:46:58,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {5133#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {5144#(and (= |ULTIMATE.start_main_~node~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} is VALID [2022-02-20 23:46:58,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {5144#(and (= |ULTIMATE.start_main_~node~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} assume !(main_~node~0#1.base == 0bv32 && main_~node~0#1.offset == 0bv32); {5144#(and (= |ULTIMATE.start_main_~node~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} is VALID [2022-02-20 23:46:58,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {5144#(and (= |ULTIMATE.start_main_~node~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~node~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_~node~0#1.offset)), #length[main_~node~0#1.base]) && ~bvule32(~bvadd32(4bv32, main_~node~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_~node~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_~node~0#1.offset))); {5134#false} is VALID [2022-02-20 23:46:58,135 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:46:58,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:58,135 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:58,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343675635] [2022-02-20 23:46:58,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343675635] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:58,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:58,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:58,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476219143] [2022-02-20 23:46:58,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:58,136 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:46:58,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:58,137 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:58,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:58,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:58,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:58,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:58,142 INFO L87 Difference]: Start difference. First operand 273 states and 299 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,620 INFO L93 Difference]: Finished difference Result 461 states and 509 transitions. [2022-02-20 23:46:59,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:59,620 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:46:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:59,620 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2022-02-20 23:46:59,622 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2022-02-20 23:46:59,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 511 transitions. [2022-02-20 23:47:00,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 511 edges. 511 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:00,056 INFO L225 Difference]: With dead ends: 461 [2022-02-20 23:47:00,056 INFO L226 Difference]: Without dead ends: 461 [2022-02-20 23:47:00,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:00,057 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 218 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:00,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 569 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:47:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-02-20 23:47:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 271. [2022-02-20 23:47:00,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:00,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand has 271 states, 155 states have (on average 1.9161290322580644) internal successors, (297), 270 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,061 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand has 271 states, 155 states have (on average 1.9161290322580644) internal successors, (297), 270 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,061 INFO L87 Difference]: Start difference. First operand 461 states. Second operand has 271 states, 155 states have (on average 1.9161290322580644) internal successors, (297), 270 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:00,069 INFO L93 Difference]: Finished difference Result 461 states and 509 transitions. [2022-02-20 23:47:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 509 transitions. [2022-02-20 23:47:00,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:00,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:00,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 271 states, 155 states have (on average 1.9161290322580644) internal successors, (297), 270 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 461 states. [2022-02-20 23:47:00,070 INFO L87 Difference]: Start difference. First operand has 271 states, 155 states have (on average 1.9161290322580644) internal successors, (297), 270 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 461 states. [2022-02-20 23:47:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:00,078 INFO L93 Difference]: Finished difference Result 461 states and 509 transitions. [2022-02-20 23:47:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 509 transitions. [2022-02-20 23:47:00,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:00,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:00,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:00,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 155 states have (on average 1.9161290322580644) internal successors, (297), 270 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2022-02-20 23:47:00,083 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 5 [2022-02-20 23:47:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:00,083 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2022-02-20 23:47:00,083 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,083 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2022-02-20 23:47:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:47:00,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:00,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:00,095 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:47:00,292 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:47:00,293 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:47:00,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:00,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1809643625, now seen corresponding path program 1 times [2022-02-20 23:47:00,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:00,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209594969] [2022-02-20 23:47:00,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:00,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:00,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:00,295 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:47:00,296 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:47:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:00,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:47:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:00,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:00,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#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(12bv32, 2bv32); {6804#true} is VALID [2022-02-20 23:47:00,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {6812#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:47:00,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {6812#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {6812#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:47:00,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {6812#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} call main_~#iter~0#1.base, main_~#iter~0#1.offset := #Ultimate.allocOnStack(8bv32);main_~list~0#1.base, main_~list~0#1.offset := main_~data~0#1.base, main_~data~0#1.offset; {6819#(and (= |ULTIMATE.start_main_~list~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:00,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {6819#(and (= |ULTIMATE.start_main_~list~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, 4bv32); srcloc: L559 {6819#(and (= |ULTIMATE.start_main_~list~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:00,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {6819#(and (= |ULTIMATE.start_main_~list~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} assume main_~list~0#1.base != 0bv32 || main_~list~0#1.offset != 0bv32; {6805#false} is VALID [2022-02-20 23:47:00,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {6805#false} assume !(1bv1 == #valid[main_~list~0#1.base]); {6805#false} is VALID [2022-02-20 23:47:00,410 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:47:00,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:00,411 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:00,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209594969] [2022-02-20 23:47:00,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209594969] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:00,411 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:00,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:00,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076247958] [2022-02-20 23:47:00,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:00,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:47:00,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:00,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:00,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:00,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:00,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:00,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:00,419 INFO L87 Difference]: Start difference. First operand 271 states and 297 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,706 INFO L93 Difference]: Finished difference Result 668 states and 734 transitions. [2022-02-20 23:47:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:01,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:47:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 735 transitions. [2022-02-20 23:47:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 735 transitions. [2022-02-20 23:47:01,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 735 transitions. [2022-02-20 23:47:02,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 735 edges. 735 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:02,370 INFO L225 Difference]: With dead ends: 668 [2022-02-20 23:47:02,371 INFO L226 Difference]: Without dead ends: 668 [2022-02-20 23:47:02,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:02,372 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 587 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:02,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [587 Valid, 855 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-02-20 23:47:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 275. [2022-02-20 23:47:02,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:02,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 668 states. Second operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,377 INFO L74 IsIncluded]: Start isIncluded. First operand 668 states. Second operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,378 INFO L87 Difference]: Start difference. First operand 668 states. Second operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,391 INFO L93 Difference]: Finished difference Result 668 states and 734 transitions. [2022-02-20 23:47:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 734 transitions. [2022-02-20 23:47:02,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:02,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:02,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 668 states. [2022-02-20 23:47:02,393 INFO L87 Difference]: Start difference. First operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 668 states. [2022-02-20 23:47:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,407 INFO L93 Difference]: Finished difference Result 668 states and 734 transitions. [2022-02-20 23:47:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 734 transitions. [2022-02-20 23:47:02,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:02,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:02,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:02,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 302 transitions. [2022-02-20 23:47:02,411 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 302 transitions. Word has length 7 [2022-02-20 23:47:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:02,411 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 302 transitions. [2022-02-20 23:47:02,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 302 transitions. [2022-02-20 23:47:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:47:02,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:02,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:02,428 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:47:02,622 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:47:02,622 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2022-02-20 23:47:02,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:02,623 INFO L85 PathProgramCache]: Analyzing trace with hash 642085168, now seen corresponding path program 1 times [2022-02-20 23:47:02,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:02,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69201615] [2022-02-20 23:47:02,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:02,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:02,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:02,624 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:47:02,625 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:47:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:02,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:47:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:02,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:02,719 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:47:02,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {9109#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(12bv32, 2bv32); {9109#true} is VALID [2022-02-20 23:47:02,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {9109#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~node~0#1.base, main_~node~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet3#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~current~0#1.base, main_~current~0#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~current~1#1.base, main_~current~1#1.offset, main_~#iter~0#1.base, main_~#iter~0#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~nondet31#1, main_#t~short33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_~pdst~0#1.base, main_~pdst~0#1.offset, main_~pdata~0#1.base, main_~pdata~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~short29#1, main_~#dst~1#1.base, main_~#dst~1#1.offset, main_~#sub1~0#1.base, main_~#sub1~0#1.offset, main_~#sub2~0#1.base, main_~#sub2~0#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_~list~1#1.base, main_~list~1#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_~list~2#1.base, main_~list~2#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_~current~2#1.base, main_~current~2#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_~current~3#1.base, main_~current~3#1.offset, main_~#iter~1#1.base, main_~#iter~1#1.offset, main_~node~3#1.base, main_~node~3#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~node~4#1.base, main_~node~4#1.offset, main_~data~0#1.base, main_~data~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {9109#true} is VALID [2022-02-20 23:47:02,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {9109#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~0#1.base, main_~node~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {9109#true} is VALID [2022-02-20 23:47:02,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {9109#true} assume !(main_~node~0#1.base == 0bv32 && main_~node~0#1.offset == 0bv32); {9109#true} is VALID [2022-02-20 23:47:02,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {9109#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~node~0#1.base, ~bvadd32(4bv32, main_~node~0#1.offset), 4bv32); srcloc: L543-2 {9109#true} is VALID [2022-02-20 23:47:02,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {9109#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet5#1, main_~node~0#1.base, main_~node~0#1.offset, 4bv32); srcloc: L545 {9109#true} is VALID [2022-02-20 23:47:02,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {9109#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {9132#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:02,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {9132#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {9132#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:02,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {9132#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~item~0#1.base]); {9110#false} is VALID [2022-02-20 23:47:02,728 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:47:02,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:02,728 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:02,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69201615] [2022-02-20 23:47:02,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69201615] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:02,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:02,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:02,728 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555020772] [2022-02-20 23:47:02,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:02,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:47:02,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:02,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:02,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:02,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:02,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:02,736 INFO L87 Difference]: Start difference. First operand 275 states and 302 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)