./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0019-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0019-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:44:28,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:44:28,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:44:28,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:44:28,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:44:28,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:44:28,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:44:28,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:44:28,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:44:28,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:44:28,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:44:28,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:44:28,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:44:28,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:44:28,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:44:28,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:44:28,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:44:28,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:44:28,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:44:28,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:44:28,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:44:28,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:44:28,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:44:28,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:44:28,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:44:28,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:44:28,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:44:28,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:44:28,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:44:28,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:44:28,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:44:28,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:44:28,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:44:28,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:44:28,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:44:28,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:44:28,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:44:28,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:44:28,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:44:28,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:44:28,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:44:28,319 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:44:28,341 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:44:28,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:44:28,344 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:44:28,344 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:44:28,344 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:44:28,345 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:44:28,345 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:44:28,345 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:44:28,345 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:44:28,345 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:44:28,346 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:44:28,346 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:44:28,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:44:28,346 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:44:28,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:44:28,347 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:44:28,347 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:44:28,347 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:44:28,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:44:28,347 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:44:28,347 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:44:28,348 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:44:28,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:44:28,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:44:28,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:44:28,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:28,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:44:28,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:44:28,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:44:28,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:44:28,349 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 -> 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd [2022-02-20 23:44:28,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:44:28,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:44:28,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:44:28,544 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:44:28,544 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:44:28,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-1.i [2022-02-20 23:44:28,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6bc182b/5ef5d45606d64f82965a71e300da95f1/FLAG262062276 [2022-02-20 23:44:28,998 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:44:28,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-1.i [2022-02-20 23:44:29,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6bc182b/5ef5d45606d64f82965a71e300da95f1/FLAG262062276 [2022-02-20 23:44:29,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6bc182b/5ef5d45606d64f82965a71e300da95f1 [2022-02-20 23:44:29,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:44:29,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:44:29,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:29,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:44:29,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:44:29,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:29" (1/1) ... [2022-02-20 23:44:29,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@683942c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29, skipping insertion in model container [2022-02-20 23:44:29,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:29" (1/1) ... [2022-02-20 23:44:29,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:44:29,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:44:29,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:29,332 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:44:29,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:29,400 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:44:29,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29 WrapperNode [2022-02-20 23:44:29,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:29,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:29,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:44:29,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:44:29,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29" (1/1) ... [2022-02-20 23:44:29,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29" (1/1) ... [2022-02-20 23:44:29,452 INFO L137 Inliner]: procedures = 125, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2022-02-20 23:44:29,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:29,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:44:29,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:44:29,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:44:29,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29" (1/1) ... [2022-02-20 23:44:29,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29" (1/1) ... [2022-02-20 23:44:29,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29" (1/1) ... [2022-02-20 23:44:29,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29" (1/1) ... [2022-02-20 23:44:29,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29" (1/1) ... [2022-02-20 23:44:29,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29" (1/1) ... [2022-02-20 23:44:29,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29" (1/1) ... [2022-02-20 23:44:29,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:44:29,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:44:29,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:44:29,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:44:29,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29" (1/1) ... [2022-02-20 23:44:29,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:29,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:29,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:44:29,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:44:29,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:44:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:44:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:44:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:44:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:44:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:44:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:44:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:44:29,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:44:29,637 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:44:29,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:44:29,800 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:44:29,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:44:29,805 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:44:29,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:29 BoogieIcfgContainer [2022-02-20 23:44:29,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:44:29,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:44:29,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:44:29,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:44:29,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:44:29" (1/3) ... [2022-02-20 23:44:29,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4524fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:29, skipping insertion in model container [2022-02-20 23:44:29,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:29" (2/3) ... [2022-02-20 23:44:29,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4524fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:29, skipping insertion in model container [2022-02-20 23:44:29,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:29" (3/3) ... [2022-02-20 23:44:29,835 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-1.i [2022-02-20 23:44:29,838 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:44:29,838 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-02-20 23:44:29,872 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:44:29,876 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:44:29,876 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-02-20 23:44:29,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:29,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:29,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:29,889 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:29,892 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:44:29,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:29,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583335945] [2022-02-20 23:44:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:29,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:30,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {53#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {53#true} is VALID [2022-02-20 23:44:30,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {53#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {55#(= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1)} is VALID [2022-02-20 23:44:30,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {55#(= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1)} assume !(1 == #valid[alloc_data_~pdata#1.base]); {54#false} is VALID [2022-02-20 23:44:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:30,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:30,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583335945] [2022-02-20 23:44:30,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583335945] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:30,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:30,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:30,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553026349] [2022-02-20 23:44:30,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:30,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:44:30,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:30,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:30,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:30,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:30,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:30,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:30,103 INFO L87 Difference]: Start difference. First operand has 50 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,209 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-02-20 23:44:30,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:30,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:44:30,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 23:44:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 23:44:30,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-02-20 23:44:30,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:30,278 INFO L225 Difference]: With dead ends: 48 [2022-02-20 23:44:30,278 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 23:44:30,280 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:44:30,282 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:30,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 32 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 23:44:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 23:44:30,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:30,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,305 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,306 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,310 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-02-20 23:44:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:44:30,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:30,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:30,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 states. [2022-02-20 23:44:30,312 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 states. [2022-02-20 23:44:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,314 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-02-20 23:44:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:44:30,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:30,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:30,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:30,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-02-20 23:44:30,320 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 3 [2022-02-20 23:44:30,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:30,320 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-02-20 23:44:30,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:44:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:30,321 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:30,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:30,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:44:30,323 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:30,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:30,325 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:44:30,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:30,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977772931] [2022-02-20 23:44:30,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:30,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:30,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {244#true} is VALID [2022-02-20 23:44:30,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {246#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)))} is VALID [2022-02-20 23:44:30,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)))} assume !(4 + alloc_data_~pdata#1.offset <= #length[alloc_data_~pdata#1.base] && 0 <= alloc_data_~pdata#1.offset); {245#false} is VALID [2022-02-20 23:44:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:30,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:30,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977772931] [2022-02-20 23:44:30,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977772931] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:30,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:30,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:30,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732210460] [2022-02-20 23:44:30,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:30,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:44:30,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:30,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:30,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:30,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:30,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:30,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:30,415 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,478 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-02-20 23:44:30,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:30,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:44:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 23:44:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 23:44:30,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-02-20 23:44:30,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:30,523 INFO L225 Difference]: With dead ends: 45 [2022-02-20 23:44:30,523 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 23:44:30,523 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:44:30,527 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:30,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:30,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 23:44:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 23:44:30,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:30,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,535 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,535 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,540 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-02-20 23:44:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-02-20 23:44:30,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:30,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:30,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 states. [2022-02-20 23:44:30,541 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 states. [2022-02-20 23:44:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,544 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-02-20 23:44:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-02-20 23:44:30,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:30,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:30,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:30,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-02-20 23:44:30,547 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 3 [2022-02-20 23:44:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:30,547 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-02-20 23:44:30,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-02-20 23:44:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:44:30,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:30,548 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:44:30,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:44:30,548 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:30,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:30,549 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-02-20 23:44:30,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:30,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695393057] [2022-02-20 23:44:30,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:30,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:30,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {429#true} is VALID [2022-02-20 23:44:30,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {429#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {431#(and (<= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0))} is VALID [2022-02-20 23:44:30,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#(and (<= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {432#(and (<= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1))} is VALID [2022-02-20 23:44:30,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {432#(and (<= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {431#(and (<= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0))} is VALID [2022-02-20 23:44:30,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {431#(and (<= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0))} assume !(4 + (4 + alloc_data_~pdata#1.offset) <= #length[alloc_data_~pdata#1.base] && 0 <= 4 + alloc_data_~pdata#1.offset); {430#false} is VALID [2022-02-20 23:44:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:30,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:30,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695393057] [2022-02-20 23:44:30,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695393057] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:30,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:30,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:30,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983925470] [2022-02-20 23:44:30,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:30,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:30,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:30,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:30,645 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:44:30,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:44:30,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:44:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:30,646 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,723 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:44:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:44:30,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 23:44:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 23:44:30,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-02-20 23:44:30,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:30,762 INFO L225 Difference]: With dead ends: 44 [2022-02-20 23:44:30,762 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 23:44:30,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:30,763 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:30,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 23 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 23:44:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 23:44:30,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:30,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,766 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,766 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,768 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:44:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:44:30,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:30,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:30,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 states. [2022-02-20 23:44:30,769 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 states. [2022-02-20 23:44:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,770 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:44:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:44:30,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:30,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:30,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:30,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-02-20 23:44:30,772 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 5 [2022-02-20 23:44:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:30,772 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-02-20 23:44:30,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:44:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:30,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:30,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:30,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:44:30,773 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:30,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2022-02-20 23:44:30,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:30,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388337794] [2022-02-20 23:44:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:30,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:30,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {611#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {611#true} is VALID [2022-02-20 23:44:30,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {611#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {613#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:44:30,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {613#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:44:30,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {613#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {613#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:44:30,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {613#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {614#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} is VALID [2022-02-20 23:44:30,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {614#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {614#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} is VALID [2022-02-20 23:44:30,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {614#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} assume { :end_inline_alloc_data } true; {614#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} is VALID [2022-02-20 23:44:30,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} assume !(1 == #valid[main_~#data~0#1.base]); {612#false} is VALID [2022-02-20 23:44:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:30,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:30,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388337794] [2022-02-20 23:44:30,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388337794] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:30,840 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:30,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:30,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029241532] [2022-02-20 23:44:30,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:30,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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:44:30,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:30,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 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:44:30,848 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:44:30,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:44:30,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:30,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:44:30,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:30,849 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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:44:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,945 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-02-20 23:44:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:44:30,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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:44:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) 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:44:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 23:44:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) 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:44:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 23:44:30,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-02-20 23:44:30,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:30,986 INFO L225 Difference]: With dead ends: 42 [2022-02-20 23:44:30,986 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 23:44:30,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:30,987 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:30,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 28 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:30,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 23:44:30,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-20 23:44:30,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:30,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,990 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,990 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,991 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-02-20 23:44:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-02-20 23:44:30,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:30,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:30,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 states. [2022-02-20 23:44:30,992 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 states. [2022-02-20 23:44:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:30,993 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-02-20 23:44:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-02-20 23:44:30,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:30,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:30,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:30,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-02-20 23:44:30,995 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 8 [2022-02-20 23:44:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:30,995 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-02-20 23:44:30,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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:44:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-02-20 23:44:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:30,996 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:30,996 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:30,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:44:30,996 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:30,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2022-02-20 23:44:30,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:30,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437013136] [2022-02-20 23:44:30,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:31,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {787#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {787#true} is VALID [2022-02-20 23:44:31,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {787#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {789#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} is VALID [2022-02-20 23:44:31,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {789#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {789#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} is VALID [2022-02-20 23:44:31,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {789#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {790#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} is VALID [2022-02-20 23:44:31,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {790#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {791#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:31,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {791#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {791#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:31,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {791#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume { :end_inline_alloc_data } true; {791#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:31,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {791#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume !(4 + main_~#data~0#1.offset <= #length[main_~#data~0#1.base] && 0 <= main_~#data~0#1.offset); {788#false} is VALID [2022-02-20 23:44:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:31,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:31,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437013136] [2022-02-20 23:44:31,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437013136] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:31,074 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:31,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:44:31,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750627289] [2022-02-20 23:44:31,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:31,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:44:31,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:31,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:44:31,089 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:44:31,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:44:31,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:31,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:44:31,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:31,090 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:44:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:31,197 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-02-20 23:44:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:44:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:44:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 23:44:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:44:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 23:44:31,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-02-20 23:44:31,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:31,243 INFO L225 Difference]: With dead ends: 40 [2022-02-20 23:44:31,243 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 23:44:31,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:44:31,244 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 98 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:31,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 27 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 23:44:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 23:44:31,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:31,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,252 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,252 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:31,253 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-02-20 23:44:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-02-20 23:44:31,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:31,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:31,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 states. [2022-02-20 23:44:31,254 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 states. [2022-02-20 23:44:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:31,255 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-02-20 23:44:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-02-20 23:44:31,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:31,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:31,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:31,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-02-20 23:44:31,257 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 8 [2022-02-20 23:44:31,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:31,257 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-02-20 23:44:31,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:44:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-02-20 23:44:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:44:31,259 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:31,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:31,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:44:31,259 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:31,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1604044760, now seen corresponding path program 1 times [2022-02-20 23:44:31,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:31,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560286523] [2022-02-20 23:44:31,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:31,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {956#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {956#true} is VALID [2022-02-20 23:44:31,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {956#true} is VALID [2022-02-20 23:44:31,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {956#true} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {956#true} is VALID [2022-02-20 23:44:31,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {956#true} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {956#true} is VALID [2022-02-20 23:44:31,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {956#true} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {956#true} is VALID [2022-02-20 23:44:31,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#true} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {956#true} is VALID [2022-02-20 23:44:31,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {956#true} assume { :end_inline_alloc_data } true; {956#true} is VALID [2022-02-20 23:44:31,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {956#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L544 {956#true} is VALID [2022-02-20 23:44:31,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {956#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, 4 + main_~#data~0#1.offset, 4); srcloc: L544-1 {956#true} is VALID [2022-02-20 23:44:31,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {956#true} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8); {958#(= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1)} is VALID [2022-02-20 23:44:31,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {958#(= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1)} assume !(1 == #valid[free_data_~#data#1.base]); {957#false} is VALID [2022-02-20 23:44:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:31,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:31,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560286523] [2022-02-20 23:44:31,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560286523] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:31,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:31,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:31,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670605965] [2022-02-20 23:44:31,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:31,332 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:44:31,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:31,333 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:44:31,342 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:44:31,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:31,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:31,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:31,344 INFO L87 Difference]: Start difference. First operand 40 states and 40 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:44:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:31,398 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 23:44:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:31,398 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:44:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:31,399 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:44:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-02-20 23:44:31,400 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:44:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-02-20 23:44:31,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-02-20 23:44:31,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:31,434 INFO L225 Difference]: With dead ends: 36 [2022-02-20 23:44:31,434 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 23:44:31,434 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:44:31,435 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:31,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 31 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 23:44:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 23:44:31,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:31,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,437 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,438 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:31,438 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 23:44:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-02-20 23:44:31,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:31,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:31,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 states. [2022-02-20 23:44:31,439 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 states. [2022-02-20 23:44:31,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:31,440 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 23:44:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-02-20 23:44:31,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:31,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:31,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:31,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-02-20 23:44:31,442 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 11 [2022-02-20 23:44:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:31,442 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-02-20 23:44:31,443 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:44:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-02-20 23:44:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:44:31,443 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:31,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:31,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:44:31,444 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1604044759, now seen corresponding path program 1 times [2022-02-20 23:44:31,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:31,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724275616] [2022-02-20 23:44:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:31,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {1105#true} is VALID [2022-02-20 23:44:31,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {1105#true} is VALID [2022-02-20 23:44:31,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {1105#true} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {1105#true} is VALID [2022-02-20 23:44:31,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {1105#true} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {1105#true} is VALID [2022-02-20 23:44:31,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {1105#true} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {1105#true} is VALID [2022-02-20 23:44:31,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {1105#true} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1105#true} is VALID [2022-02-20 23:44:31,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {1105#true} assume { :end_inline_alloc_data } true; {1105#true} is VALID [2022-02-20 23:44:31,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {1105#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L544 {1105#true} is VALID [2022-02-20 23:44:31,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {1105#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, 4 + main_~#data~0#1.offset, 4); srcloc: L544-1 {1105#true} is VALID [2022-02-20 23:44:31,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {1105#true} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8); {1107#(and (= (+ (select |#length| |ULTIMATE.start_free_data_~#data#1.base|) (- 8)) 0) (= |ULTIMATE.start_free_data_~#data#1.offset| 0))} is VALID [2022-02-20 23:44:31,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {1107#(and (= (+ (select |#length| |ULTIMATE.start_free_data_~#data#1.base|) (- 8)) 0) (= |ULTIMATE.start_free_data_~#data#1.offset| 0))} assume !(4 + free_data_~#data#1.offset <= #length[free_data_~#data#1.base] && 0 <= free_data_~#data#1.offset); {1106#false} is VALID [2022-02-20 23:44:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:31,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:31,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724275616] [2022-02-20 23:44:31,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724275616] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:31,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:31,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:31,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693847929] [2022-02-20 23:44:31,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:31,486 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:44:31,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:31,486 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:44:31,500 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:44:31,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:31,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:31,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:31,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:31,502 INFO L87 Difference]: Start difference. First operand 36 states and 36 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:44:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:31,550 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-02-20 23:44:31,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:31,550 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:44:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:31,551 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:44:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-20 23:44:31,551 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:44:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-20 23:44:31,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-02-20 23:44:31,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:31,581 INFO L225 Difference]: With dead ends: 32 [2022-02-20 23:44:31,581 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 23:44:31,582 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:44:31,582 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:31,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:31,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 23:44:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 23:44:31,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:31,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,584 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,585 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:31,585 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-02-20 23:44:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-02-20 23:44:31,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:31,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:31,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 states. [2022-02-20 23:44:31,586 INFO L87 Difference]: Start difference. First operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 states. [2022-02-20 23:44:31,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:31,587 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-02-20 23:44:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-02-20 23:44:31,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:31,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:31,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:31,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-02-20 23:44:31,589 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 11 [2022-02-20 23:44:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:31,589 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-02-20 23:44:31,589 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:44:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-02-20 23:44:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:44:31,590 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:31,590 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:31,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:44:31,590 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:31,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash -353452457, now seen corresponding path program 1 times [2022-02-20 23:44:31,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:31,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65721936] [2022-02-20 23:44:31,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:31,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:31,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {1238#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {1238#true} is VALID [2022-02-20 23:44:31,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {1238#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {1240#(and (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:31,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {1240#(and (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {1241#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:31,704 INFO L290 TraceCheckUtils]: 3: Hoare triple {1241#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {1241#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:31,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {1241#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {1242#(= (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:44:31,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {1242#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1242#(= (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:44:31,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {1242#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} assume { :end_inline_alloc_data } true; {1242#(= (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:44:31,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {1242#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L544 {1243#(= |ULTIMATE.start_main_#t~mem7#1.offset| 0)} is VALID [2022-02-20 23:44:31,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {1243#(= |ULTIMATE.start_main_#t~mem7#1.offset| 0)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, 4 + main_~#data~0#1.offset, 4); srcloc: L544-1 {1243#(= |ULTIMATE.start_main_#t~mem7#1.offset| 0)} is VALID [2022-02-20 23:44:31,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {1243#(= |ULTIMATE.start_main_#t~mem7#1.offset| 0)} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8); {1244#(= |ULTIMATE.start_free_data_#in~data#1.lo.offset| 0)} is VALID [2022-02-20 23:44:31,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {1244#(= |ULTIMATE.start_free_data_#in~data#1.lo.offset| 0)} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532 {1245#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) 0)} is VALID [2022-02-20 23:44:31,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {1245#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) 0)} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L532-1 {1245#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) 0)} is VALID [2022-02-20 23:44:31,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {1245#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) 0)} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532-2 {1246#(= |ULTIMATE.start_free_data_#t~mem5#1.offset| 0)} is VALID [2022-02-20 23:44:31,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {1246#(= |ULTIMATE.start_free_data_#t~mem5#1.offset| 0)} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {1247#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} is VALID [2022-02-20 23:44:31,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {1247#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L535 {1247#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} is VALID [2022-02-20 23:44:31,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {1247#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {1247#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} is VALID [2022-02-20 23:44:31,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {1247#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {1247#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} is VALID [2022-02-20 23:44:31,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {1247#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} assume !(0 == free_data_~lo~0#1.offset); {1239#false} is VALID [2022-02-20 23:44:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:31,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:31,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65721936] [2022-02-20 23:44:31,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65721936] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:31,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:31,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:44:31,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677215745] [2022-02-20 23:44:31,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:31,717 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:44:31,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:31,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:31,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:31,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:44:31,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:31,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:44:31,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:44:31,735 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:32,015 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:44:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:44:32,015 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:44:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2022-02-20 23:44:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2022-02-20 23:44:32,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 32 transitions. [2022-02-20 23:44:32,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:32,047 INFO L225 Difference]: With dead ends: 31 [2022-02-20 23:44:32,048 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 23:44:32,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:44:32,048 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:32,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 94 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 23:44:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 23:44:32,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:32,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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:44:32,050 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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:44:32,050 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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:44:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:32,051 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:44:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:44:32,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:32,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:32,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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) Second operand 31 states. [2022-02-20 23:44:32,051 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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) Second operand 31 states. [2022-02-20 23:44:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:32,053 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:44:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:44:32,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:32,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:32,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:32,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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:44:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-02-20 23:44:32,054 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 18 [2022-02-20 23:44:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:32,054 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-02-20 23:44:32,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:44:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:44:32,055 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:32,055 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:44:32,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:44:32,056 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:32,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1927874256, now seen corresponding path program 1 times [2022-02-20 23:44:32,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:32,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477415208] [2022-02-20 23:44:32,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:32,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {1392#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {1392#true} is VALID [2022-02-20 23:44:32,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {1392#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {1394#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 1))} is VALID [2022-02-20 23:44:32,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {1394#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 1))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {1395#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) 1) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} is VALID [2022-02-20 23:44:32,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {1395#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) 1) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {1396#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} is VALID [2022-02-20 23:44:32,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {1396#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {1397#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} is VALID [2022-02-20 23:44:32,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {1397#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1397#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} is VALID [2022-02-20 23:44:32,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {1397#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} assume { :end_inline_alloc_data } true; {1397#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} is VALID [2022-02-20 23:44:32,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {1397#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L544 {1398#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) |ULTIMATE.start_main_#t~mem7#1.base|)))} is VALID [2022-02-20 23:44:32,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {1398#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) |ULTIMATE.start_main_#t~mem7#1.base|)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, 4 + main_~#data~0#1.offset, 4); srcloc: L544-1 {1399#(not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_#t~mem8#1.base|))} is VALID [2022-02-20 23:44:32,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {1399#(not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_#t~mem8#1.base|))} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8); {1400#(not (= |ULTIMATE.start_free_data_#in~data#1.lo.base| |ULTIMATE.start_free_data_#in~data#1.hi.base|))} is VALID [2022-02-20 23:44:32,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {1400#(not (= |ULTIMATE.start_free_data_#in~data#1.lo.base| |ULTIMATE.start_free_data_#in~data#1.hi.base|))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532 {1401#(not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))} is VALID [2022-02-20 23:44:32,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {1401#(not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L532-1 {1402#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))} is VALID [2022-02-20 23:44:32,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {1402#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532-2 {1403#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) |ULTIMATE.start_free_data_#t~mem5#1.base|))} is VALID [2022-02-20 23:44:32,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {1403#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) |ULTIMATE.start_free_data_#t~mem5#1.base|))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {1404#(not (= |ULTIMATE.start_free_data_~lo~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4))))} is VALID [2022-02-20 23:44:32,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {1404#(not (= |ULTIMATE.start_free_data_~lo~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4))))} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L535 {1405#(not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_#t~mem6#1.base|))} is VALID [2022-02-20 23:44:32,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {1405#(not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_#t~mem6#1.base|))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {1406#(not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|))} is VALID [2022-02-20 23:44:32,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {1406#(not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|))} assume free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset;call ULTIMATE.dealloc(free_data_~#data#1.base, free_data_~#data#1.offset);havoc free_data_~#data#1.base, free_data_~#data#1.offset; {1393#false} is VALID [2022-02-20 23:44:32,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {1393#false} assume { :end_inline_free_data } true;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#res#1 := 0;call ULTIMATE.dealloc(main_~#data~0#1.base, main_~#data~0#1.offset);havoc main_~#data~0#1.base, main_~#data~0#1.offset; {1393#false} is VALID [2022-02-20 23:44:32,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {1393#false} assume !(#valid == main_old_#valid#1); {1393#false} is VALID [2022-02-20 23:44:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:32,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:32,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477415208] [2022-02-20 23:44:32,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477415208] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:32,336 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:32,336 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 23:44:32,336 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178492562] [2022-02-20 23:44:32,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:32,337 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:44:32,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:32,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:44:32,356 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:44:32,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:44:32,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:32,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:44:32,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:44:32,357 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:44:33,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,058 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2022-02-20 23:44:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:44:33,058 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:44:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:44:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2022-02-20 23:44:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:44:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2022-02-20 23:44:33,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 31 transitions. [2022-02-20 23:44:33,085 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:44:33,086 INFO L225 Difference]: With dead ends: 31 [2022-02-20 23:44:33,086 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 23:44:33,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2022-02-20 23:44:33,086 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 87 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:33,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 83 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:44:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 23:44:33,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 23:44:33,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:33,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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:44:33,088 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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:44:33,088 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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:44:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,089 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2022-02-20 23:44:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2022-02-20 23:44:33,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:33,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:33,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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) Second operand 31 states. [2022-02-20 23:44:33,089 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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) Second operand 31 states. [2022-02-20 23:44:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,090 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2022-02-20 23:44:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2022-02-20 23:44:33,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:33,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:33,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:33,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:33,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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:44:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2022-02-20 23:44:33,091 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 19 [2022-02-20 23:44:33,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:33,091 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2022-02-20 23:44:33,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:44:33,091 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2022-02-20 23:44:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:44:33,091 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:33,091 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:44:33,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:44:33,092 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:33,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:33,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1927875793, now seen corresponding path program 1 times [2022-02-20 23:44:33,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:33,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245580639] [2022-02-20 23:44:33,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:33,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:33,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {1563#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {1563#true} is VALID [2022-02-20 23:44:33,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {1563#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {1565#(and (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ |ULTIMATE.start_alloc_data_#t~malloc3#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:44:33,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {1565#(and (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ |ULTIMATE.start_alloc_data_#t~malloc3#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {1566#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:33,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {1566#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {1566#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:33,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {1566#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {1567#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {1567#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1567#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {1567#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} assume { :end_inline_alloc_data } true; {1567#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {1567#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L544 {1568#(<= (+ |ULTIMATE.start_main_#t~mem7#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {1568#(<= (+ |ULTIMATE.start_main_#t~mem7#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, 4 + main_~#data~0#1.offset, 4); srcloc: L544-1 {1568#(<= (+ |ULTIMATE.start_main_#t~mem7#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {1568#(<= (+ |ULTIMATE.start_main_#t~mem7#1.base| 1) |#StackHeapBarrier|)} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8); {1569#(<= (+ |ULTIMATE.start_free_data_#in~data#1.lo.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {1569#(<= (+ |ULTIMATE.start_free_data_#in~data#1.lo.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532 {1570#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {1570#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L532-1 {1570#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {1570#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532-2 {1571#(<= (+ 1 |ULTIMATE.start_free_data_#t~mem5#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {1571#(<= (+ 1 |ULTIMATE.start_free_data_#t~mem5#1.base|) |#StackHeapBarrier|)} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {1572#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {1572#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L535 {1572#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {1572#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {1572#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {1572#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {1572#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {1572#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == free_data_~lo~0#1.offset; {1572#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:33,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {1572#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} assume !(free_data_~lo~0#1.base < #StackHeapBarrier); {1564#false} is VALID [2022-02-20 23:44:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:33,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:33,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245580639] [2022-02-20 23:44:33,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245580639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:33,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:33,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:44:33,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189173979] [2022-02-20 23:44:33,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:33,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:44:33,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:33,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:44:33,227 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:44:33,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:44:33,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:33,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:44:33,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:44:33,228 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:44:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,554 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-02-20 23:44:33,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:44:33,555 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:44:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:44:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 30 transitions. [2022-02-20 23:44:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:44:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 30 transitions. [2022-02-20 23:44:33,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 30 transitions. [2022-02-20 23:44:33,605 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:44:33,605 INFO L225 Difference]: With dead ends: 30 [2022-02-20 23:44:33,605 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:44:33,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:44:33,606 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:33,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 45 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:44:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 23:44:33,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:33,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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:44:33,607 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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:44:33,607 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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:44:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,608 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-02-20 23:44:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2022-02-20 23:44:33,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:33,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:33,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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) Second operand 30 states. [2022-02-20 23:44:33,610 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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) Second operand 30 states. [2022-02-20 23:44:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,610 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-02-20 23:44:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2022-02-20 23:44:33,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:33,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:33,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:33,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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:44:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 29 transitions. [2022-02-20 23:44:33,611 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 29 transitions. Word has length 19 [2022-02-20 23:44:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:33,611 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 29 transitions. [2022-02-20 23:44:33,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:44:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2022-02-20 23:44:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:44:33,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:33,612 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:33,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:44:33,612 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:33,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -365392487, now seen corresponding path program 1 times [2022-02-20 23:44:33,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:33,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047152051] [2022-02-20 23:44:33,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:33,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:33,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {1713#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {1713#true} is VALID [2022-02-20 23:44:33,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {1713#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {1715#(and (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 1))} is VALID [2022-02-20 23:44:33,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {1715#(and (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 1))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {1716#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:33,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {1716#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {1716#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:33,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {1716#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {1717#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:44:33,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {1717#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1717#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:44:33,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {1717#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} assume { :end_inline_alloc_data } true; {1717#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:44:33,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {1717#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L544 {1718#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:44:33,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {1718#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, 4 + main_~#data~0#1.offset, 4); srcloc: L544-1 {1718#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:44:33,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {1718#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8); {1719#(or (= |ULTIMATE.start_free_data_#in~data#1.lo.base| |ULTIMATE.start_free_data_~#data#1.base|) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.lo.base|) 1))} is VALID [2022-02-20 23:44:33,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {1719#(or (= |ULTIMATE.start_free_data_#in~data#1.lo.base| |ULTIMATE.start_free_data_~#data#1.base|) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.lo.base|) 1))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532 {1720#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) 1)} is VALID [2022-02-20 23:44:33,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {1720#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) 1)} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L532-1 {1720#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) 1)} is VALID [2022-02-20 23:44:33,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {1720#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) 1)} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532-2 {1721#(= (select |#valid| |ULTIMATE.start_free_data_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:44:33,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {1721#(= (select |#valid| |ULTIMATE.start_free_data_#t~mem5#1.base|) 1)} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {1722#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} is VALID [2022-02-20 23:44:33,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {1722#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L535 {1722#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} is VALID [2022-02-20 23:44:33,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {1722#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {1722#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} is VALID [2022-02-20 23:44:33,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {1722#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {1722#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} is VALID [2022-02-20 23:44:33,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {1722#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} assume 0 == free_data_~lo~0#1.offset; {1722#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} is VALID [2022-02-20 23:44:33,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {1722#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} assume free_data_~lo~0#1.base < #StackHeapBarrier; {1722#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} is VALID [2022-02-20 23:44:33,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {1722#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} assume !(0 == free_data_~lo~0#1.base || 1 == #valid[free_data_~lo~0#1.base]); {1714#false} is VALID [2022-02-20 23:44:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:33,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:33,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047152051] [2022-02-20 23:44:33,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047152051] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:33,806 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:33,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:44:33,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084748857] [2022-02-20 23:44:33,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:33,807 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 23:44:33,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:33,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:33,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:44:33,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:33,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:44:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:44:33,824 INFO L87 Difference]: Start difference. First operand 30 states and 29 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,090 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:44:34,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:44:34,090 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 23:44:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2022-02-20 23:44:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2022-02-20 23:44:34,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 29 transitions. [2022-02-20 23:44:34,111 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:44:34,112 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:44:34,112 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 23:44:34,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:44:34,112 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 60 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:44:34,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 60 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 23:44:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 23:44:34,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:34,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,114 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,114 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,114 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:44:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2022-02-20 23:44:34,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:34,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:34,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 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 29 states. [2022-02-20 23:44:34,115 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 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 29 states. [2022-02-20 23:44:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,115 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:44:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2022-02-20 23:44:34,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:34,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:34,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:34,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2022-02-20 23:44:34,116 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 20 [2022-02-20 23:44:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:34,116 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2022-02-20 23:44:34,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2022-02-20 23:44:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:44:34,117 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:34,117 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:34,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:44:34,117 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1557734867, now seen corresponding path program 1 times [2022-02-20 23:44:34,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:34,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063606525] [2022-02-20 23:44:34,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:34,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {1855#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {1855#true} is VALID [2022-02-20 23:44:34,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {1857#(and (= (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| (* (- 1) |ULTIMATE.start_main_~#data~0#1.offset|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:34,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {1857#(and (= (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| (* (- 1) |ULTIMATE.start_main_~#data~0#1.offset|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {1857#(and (= (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| (* (- 1) |ULTIMATE.start_main_~#data~0#1.offset|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:34,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {1857#(and (= (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| (* (- 1) |ULTIMATE.start_main_~#data~0#1.offset|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {1858#(and (= (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| (* (- 1) |ULTIMATE.start_main_~#data~0#1.offset|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| 0))} is VALID [2022-02-20 23:44:34,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {1858#(and (= (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| (* (- 1) |ULTIMATE.start_main_~#data~0#1.offset|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| 0))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {1859#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 0)} is VALID [2022-02-20 23:44:34,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {1859#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 0)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1859#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 0)} is VALID [2022-02-20 23:44:34,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {1859#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 0)} assume { :end_inline_alloc_data } true; {1859#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 0)} is VALID [2022-02-20 23:44:34,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {1859#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 0)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L544 {1859#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 0)} is VALID [2022-02-20 23:44:34,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {1859#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 0)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, 4 + main_~#data~0#1.offset, 4); srcloc: L544-1 {1860#(= |ULTIMATE.start_main_#t~mem8#1.offset| 0)} is VALID [2022-02-20 23:44:34,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {1860#(= |ULTIMATE.start_main_#t~mem8#1.offset| 0)} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8); {1861#(= |ULTIMATE.start_free_data_#in~data#1.hi.offset| 0)} is VALID [2022-02-20 23:44:34,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {1861#(= |ULTIMATE.start_free_data_#in~data#1.hi.offset| 0)} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532 {1861#(= |ULTIMATE.start_free_data_#in~data#1.hi.offset| 0)} is VALID [2022-02-20 23:44:34,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {1861#(= |ULTIMATE.start_free_data_#in~data#1.hi.offset| 0)} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L532-1 {1862#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) 0)} is VALID [2022-02-20 23:44:34,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {1862#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) 0)} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532-2 {1862#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) 0)} is VALID [2022-02-20 23:44:34,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {1862#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) 0)} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {1862#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) 0)} is VALID [2022-02-20 23:44:34,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {1862#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) 0)} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L535 {1863#(= |ULTIMATE.start_free_data_#t~mem6#1.offset| 0)} is VALID [2022-02-20 23:44:34,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {1863#(= |ULTIMATE.start_free_data_#t~mem6#1.offset| 0)} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {1864#(= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|)} is VALID [2022-02-20 23:44:34,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {1864#(= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|)} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {1864#(= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|)} is VALID [2022-02-20 23:44:34,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {1864#(= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|)} assume 0 == free_data_~lo~0#1.offset; {1864#(= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|)} is VALID [2022-02-20 23:44:34,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {1864#(= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|)} assume free_data_~lo~0#1.base < #StackHeapBarrier; {1864#(= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|)} is VALID [2022-02-20 23:44:34,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {1864#(= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|)} assume 0 == free_data_~lo~0#1.base || 1 == #valid[free_data_~lo~0#1.base];call ULTIMATE.dealloc(free_data_~lo~0#1.base, free_data_~lo~0#1.offset); {1864#(= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|)} is VALID [2022-02-20 23:44:34,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {1864#(= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|)} assume !(0 == free_data_~hi~0#1.offset); {1856#false} is VALID [2022-02-20 23:44:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:34,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:34,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063606525] [2022-02-20 23:44:34,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063606525] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:34,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:34,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:44:34,228 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808499130] [2022-02-20 23:44:34,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:34,229 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 23:44:34,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:34,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:34,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:44:34,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:34,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:44:34,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:44:34,246 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,498 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2022-02-20 23:44:34,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:44:34,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 23:44:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-02-20 23:44:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-02-20 23:44:34,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-02-20 23:44:34,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:34,522 INFO L225 Difference]: With dead ends: 28 [2022-02-20 23:44:34,522 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 23:44:34,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:44:34,523 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:34,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 68 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 23:44:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 23:44:34,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:34,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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:44:34,524 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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:44:34,525 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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:44:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,525 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2022-02-20 23:44:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2022-02-20 23:44:34,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:34,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:34,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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) Second operand 28 states. [2022-02-20 23:44:34,526 INFO L87 Difference]: Start difference. First operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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) Second operand 28 states. [2022-02-20 23:44:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,526 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2022-02-20 23:44:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2022-02-20 23:44:34,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:34,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:34,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:34,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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:44:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2022-02-20 23:44:34,527 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 21 [2022-02-20 23:44:34,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:34,527 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2022-02-20 23:44:34,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2022-02-20 23:44:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:44:34,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:34,527 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:34,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:44:34,528 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:34,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:34,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1045140699, now seen corresponding path program 1 times [2022-02-20 23:44:34,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:34,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626858726] [2022-02-20 23:44:34,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:34,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:34,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {1999#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {1999#true} is VALID [2022-02-20 23:44:34,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {1999#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {2001#(and (= (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| (* (- 1) |ULTIMATE.start_main_~#data~0#1.offset|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:34,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {2001#(and (= (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| (* (- 1) |ULTIMATE.start_main_~#data~0#1.offset|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {2001#(and (= (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| (* (- 1) |ULTIMATE.start_main_~#data~0#1.offset|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:34,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {2001#(and (= (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| (* (- 1) |ULTIMATE.start_main_~#data~0#1.offset|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {2002#(and (<= (+ |ULTIMATE.start_alloc_data_#t~malloc4#1.base| 1) |#StackHeapBarrier|) (= (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| (* (- 1) |ULTIMATE.start_main_~#data~0#1.offset|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:34,635 INFO L290 TraceCheckUtils]: 4: Hoare triple {2002#(and (<= (+ |ULTIMATE.start_alloc_data_#t~malloc4#1.base| 1) |#StackHeapBarrier|) (= (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| (* (- 1) |ULTIMATE.start_main_~#data~0#1.offset|)) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {2003#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {2003#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 1) |#StackHeapBarrier|)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2003#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {2003#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 1) |#StackHeapBarrier|)} assume { :end_inline_alloc_data } true; {2003#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {2003#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L544 {2003#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {2003#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, 4 + main_~#data~0#1.offset, 4); srcloc: L544-1 {2004#(<= (+ |ULTIMATE.start_main_#t~mem8#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {2004#(<= (+ |ULTIMATE.start_main_#t~mem8#1.base| 1) |#StackHeapBarrier|)} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8); {2005#(<= (+ |ULTIMATE.start_free_data_#in~data#1.hi.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {2005#(<= (+ |ULTIMATE.start_free_data_#in~data#1.hi.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532 {2005#(<= (+ |ULTIMATE.start_free_data_#in~data#1.hi.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {2005#(<= (+ |ULTIMATE.start_free_data_#in~data#1.hi.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L532-1 {2006#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {2006#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) 1) |#StackHeapBarrier|)} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532-2 {2006#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {2006#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) 1) |#StackHeapBarrier|)} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {2006#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {2006#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) 1) |#StackHeapBarrier|)} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L535 {2007#(<= (+ |ULTIMATE.start_free_data_#t~mem6#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {2007#(<= (+ |ULTIMATE.start_free_data_#t~mem6#1.base| 1) |#StackHeapBarrier|)} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {2008#(<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {2008#(<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|)} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {2008#(<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {2008#(<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == free_data_~lo~0#1.offset; {2008#(<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {2008#(<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|)} assume free_data_~lo~0#1.base < #StackHeapBarrier; {2008#(<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {2008#(<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == free_data_~lo~0#1.base || 1 == #valid[free_data_~lo~0#1.base];call ULTIMATE.dealloc(free_data_~lo~0#1.base, free_data_~lo~0#1.offset); {2008#(<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {2008#(<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == free_data_~hi~0#1.offset; {2008#(<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:34,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {2008#(<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|)} assume !(free_data_~hi~0#1.base < #StackHeapBarrier); {2000#false} is VALID [2022-02-20 23:44:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:34,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:34,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626858726] [2022-02-20 23:44:34,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626858726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:34,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:34,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:44:34,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010566033] [2022-02-20 23:44:34,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:34,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:44:34,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:34,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:34,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:44:34,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:44:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:44:34,664 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,973 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2022-02-20 23:44:34,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:44:34,973 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:44:34,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:34,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. [2022-02-20 23:44:34,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. [2022-02-20 23:44:34,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 27 transitions. [2022-02-20 23:44:34,996 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:44:34,996 INFO L225 Difference]: With dead ends: 27 [2022-02-20 23:44:34,996 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 23:44:34,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:44:34,997 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:34,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 40 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:34,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 23:44:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 23:44:34,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:34,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 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:44:34,998 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 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:44:34,998 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 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:44:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,999 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2022-02-20 23:44:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2022-02-20 23:44:34,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:34,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:34,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 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) Second operand 27 states. [2022-02-20 23:44:34,999 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 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) Second operand 27 states. [2022-02-20 23:44:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:35,000 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2022-02-20 23:44:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2022-02-20 23:44:35,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:35,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:35,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:35,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 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:44:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2022-02-20 23:44:35,001 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2022-02-20 23:44:35,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:35,001 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2022-02-20 23:44:35,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2022-02-20 23:44:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:44:35,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:35,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:35,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:44:35,001 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:35,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1960376619, now seen corresponding path program 1 times [2022-02-20 23:44:35,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:35,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576510326] [2022-02-20 23:44:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:35,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:35,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {2139#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {2139#true} is VALID [2022-02-20 23:44:35,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {2139#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {2141#(and (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 1))} is VALID [2022-02-20 23:44:35,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {2141#(and (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 1))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {2142#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} is VALID [2022-02-20 23:44:35,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {2142#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {2143#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) 1))} is VALID [2022-02-20 23:44:35,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {2143#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) 1))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {2144#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} is VALID [2022-02-20 23:44:35,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {2144#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2144#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} is VALID [2022-02-20 23:44:35,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {2144#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} assume { :end_inline_alloc_data } true; {2144#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} is VALID [2022-02-20 23:44:35,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {2144#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L544 {2145#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) |ULTIMATE.start_main_#t~mem7#1.base|)))} is VALID [2022-02-20 23:44:35,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {2145#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) |ULTIMATE.start_main_#t~mem7#1.base|)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, 4 + main_~#data~0#1.offset, 4); srcloc: L544-1 {2146#(and (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_#t~mem8#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1))} is VALID [2022-02-20 23:44:35,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {2146#(and (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_#t~mem8#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1))} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8); {2147#(and (not (= |ULTIMATE.start_free_data_#in~data#1.lo.base| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|) 1))} is VALID [2022-02-20 23:44:35,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {2147#(and (not (= |ULTIMATE.start_free_data_#in~data#1.lo.base| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|) 1))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532 {2148#(and (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|) 1) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))))} is VALID [2022-02-20 23:44:35,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {2148#(and (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|) 1) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L532-1 {2149#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))))} is VALID [2022-02-20 23:44:35,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {2149#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4); srcloc: L532-2 {2150#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) |ULTIMATE.start_free_data_#t~mem5#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4))) 1))} is VALID [2022-02-20 23:44:35,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {2150#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) |ULTIMATE.start_free_data_#t~mem5#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4))) 1))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {2151#(and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4))) 1))} is VALID [2022-02-20 23:44:35,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {2151#(and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (+ |ULTIMATE.start_free_data_~#data#1.offset| 4))) 1))} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, 4 + free_data_~#data#1.offset, 4); srcloc: L535 {2152#(and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_#t~mem6#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_#t~mem6#1.base|) 1))} is VALID [2022-02-20 23:44:35,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {2152#(and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_#t~mem6#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_#t~mem6#1.base|) 1))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {2153#(and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)))} is VALID [2022-02-20 23:44:35,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {2153#(and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)))} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {2153#(and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)))} is VALID [2022-02-20 23:44:35,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {2153#(and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)))} assume 0 == free_data_~lo~0#1.offset; {2153#(and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)))} is VALID [2022-02-20 23:44:35,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {2153#(and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)))} assume free_data_~lo~0#1.base < #StackHeapBarrier; {2153#(and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)))} is VALID [2022-02-20 23:44:35,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {2153#(and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)))} assume 0 == free_data_~lo~0#1.base || 1 == #valid[free_data_~lo~0#1.base];call ULTIMATE.dealloc(free_data_~lo~0#1.base, free_data_~lo~0#1.offset); {2154#(= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1)} is VALID [2022-02-20 23:44:35,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {2154#(= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1)} assume 0 == free_data_~hi~0#1.offset; {2154#(= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1)} is VALID [2022-02-20 23:44:35,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {2154#(= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1)} assume free_data_~hi~0#1.base < #StackHeapBarrier; {2154#(= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1)} is VALID [2022-02-20 23:44:35,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {2154#(= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1)} assume !(0 == free_data_~hi~0#1.base || 1 == #valid[free_data_~hi~0#1.base]); {2140#false} is VALID [2022-02-20 23:44:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:35,272 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:35,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576510326] [2022-02-20 23:44:35,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576510326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:35,272 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:35,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 23:44:35,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424081770] [2022-02-20 23:44:35,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:35,273 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:44:35,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:35,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:35,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:44:35,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:35,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:44:35,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:44:35,291 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:35,885 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 23:44:35,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:44:35,885 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:44:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2022-02-20 23:44:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2022-02-20 23:44:35,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 26 transitions. [2022-02-20 23:44:35,909 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:44:35,909 INFO L225 Difference]: With dead ends: 26 [2022-02-20 23:44:35,909 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 23:44:35,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2022-02-20 23:44:35,910 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:35,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 46 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:44:35,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 23:44:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 23:44:35,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:35,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,911 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,911 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:35,911 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 23:44:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-02-20 23:44:35,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:35,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:35,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 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 26 states. [2022-02-20 23:44:35,912 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 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 26 states. [2022-02-20 23:44:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:35,912 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 23:44:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-02-20 23:44:35,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:35,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:35,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:35,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2022-02-20 23:44:35,913 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 23 [2022-02-20 23:44:35,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:35,913 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2022-02-20 23:44:35,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-02-20 23:44:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:44:35,914 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:35,914 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:35,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:44:35,914 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:35,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1568714712, now seen corresponding path program 1 times [2022-02-20 23:44:35,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:35,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518574084] [2022-02-20 23:44:35,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:35,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:35,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:44:35,952 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.closeWeakPath(ArrayInterpolator.java:1412) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.interpolateWeakPathInfo(ArrayInterpolator.java:1070) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.buildRecursiveInterpolant(ArrayInterpolator.java:2229) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.interpolateStorePathInfoExt(ArrayInterpolator.java:1206) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator.computeWeakeqExtInterpolants(ArrayInterpolator.java:306) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator.computeInterpolants(ArrayInterpolator.java:197) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:326) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:145) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:250) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.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.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) 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:44:35,956 INFO L158 Benchmark]: Toolchain (without parser) took 6923.31ms. Allocated memory was 167.8MB in the beginning and 278.9MB in the end (delta: 111.1MB). Free memory was 135.0MB in the beginning and 114.0MB in the end (delta: 21.0MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. [2022-02-20 23:44:35,956 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 92.3MB. Free memory was 48.0MB in the beginning and 48.0MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:35,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.03ms. Allocated memory is still 167.8MB. Free memory was 135.0MB in the beginning and 134.5MB in the end (delta: 518.7kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:44:35,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.19ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 132.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:35,956 INFO L158 Benchmark]: Boogie Preprocessor took 36.81ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 130.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:35,957 INFO L158 Benchmark]: RCFGBuilder took 316.29ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 114.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 23:44:35,957 INFO L158 Benchmark]: TraceAbstraction took 6147.66ms. Allocated memory was 167.8MB in the beginning and 278.9MB in the end (delta: 111.1MB). Free memory was 114.0MB in the beginning and 114.0MB in the end (delta: 38.3kB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. [2022-02-20 23:44:35,958 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.13ms. Allocated memory is still 92.3MB. Free memory was 48.0MB in the beginning and 48.0MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.03ms. Allocated memory is still 167.8MB. Free memory was 135.0MB in the beginning and 134.5MB in the end (delta: 518.7kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.19ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 132.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.81ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 130.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 316.29ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 114.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6147.66ms. Allocated memory was 167.8MB in the beginning and 278.9MB in the end (delta: 111.1MB). Free memory was 114.0MB in the beginning and 114.0MB in the end (delta: 38.3kB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:44:35,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 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-0019-1.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 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:44:37,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:44:37,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:44:37,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:44:37,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:44:37,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:44:37,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:44:37,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:44:37,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:44:37,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:44:37,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:44:37,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:44:37,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:44:37,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:44:37,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:44:37,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:44:37,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:44:37,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:44:37,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:44:37,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:44:37,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:44:37,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:44:37,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:44:37,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:44:37,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:44:37,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:44:37,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:44:37,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:44:37,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:44:37,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:44:37,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:44:37,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:44:37,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:44:37,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:44:37,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:44:37,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:44:37,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:44:37,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:44:37,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:44:37,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:44:37,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:44:37,852 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:44:37,881 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:44:37,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:44:37,882 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:44:37,883 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:44:37,883 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:44:37,883 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:44:37,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:44:37,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:44:37,885 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:44:37,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:44:37,886 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:44:37,886 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:44:37,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:44:37,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:44:37,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:44:37,886 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:44:37,886 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:44:37,887 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:44:37,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:44:37,887 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:44:37,887 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:44:37,887 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:44:37,887 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:44:37,888 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:44:37,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:44:37,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:44:37,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:44:37,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:37,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:44:37,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:44:37,889 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:44:37,889 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:44:37,889 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:44:37,889 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 -> 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd [2022-02-20 23:44:38,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:44:38,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:44:38,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:44:38,186 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:44:38,187 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:44:38,189 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-1.i [2022-02-20 23:44:38,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93c9eb4d/a19b69736a674febb57a9551494f620b/FLAG6ef033ac3 [2022-02-20 23:44:38,599 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:44:38,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-1.i [2022-02-20 23:44:38,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93c9eb4d/a19b69736a674febb57a9551494f620b/FLAG6ef033ac3 [2022-02-20 23:44:38,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93c9eb4d/a19b69736a674febb57a9551494f620b [2022-02-20 23:44:38,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:44:38,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:44:38,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:38,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:44:38,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:44:38,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:38,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22586eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38, skipping insertion in model container [2022-02-20 23:44:38,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:38,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:44:38,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:44:38,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:38,907 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:44:38,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:38,990 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:44:38,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38 WrapperNode [2022-02-20 23:44:38,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:38,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:38,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:44:38,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:44:38,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:39,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:39,048 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2022-02-20 23:44:39,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:39,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:44:39,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:44:39,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:44:39,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:39,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:39,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:39,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:39,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:39,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:39,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:39,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:44:39,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:44:39,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:44:39,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:44:39,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:39,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:39,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:39,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:44:39,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:44:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:44:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:44:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:44:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:44:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:44:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:44:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:44:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:44:39,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:44:39,283 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:44:39,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:44:39,508 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:44:39,513 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:44:39,513 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:44:39,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:39 BoogieIcfgContainer [2022-02-20 23:44:39,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:44:39,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:44:39,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:44:39,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:44:39,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:44:38" (1/3) ... [2022-02-20 23:44:39,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d9cb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:39, skipping insertion in model container [2022-02-20 23:44:39,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38" (2/3) ... [2022-02-20 23:44:39,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d9cb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:39, skipping insertion in model container [2022-02-20 23:44:39,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:39" (3/3) ... [2022-02-20 23:44:39,519 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-1.i [2022-02-20 23:44:39,522 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:44:39,522 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-02-20 23:44:39,549 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:44:39,553 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:44:39,553 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-02-20 23:44:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:39,567 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:39,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:39,568 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:39,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:44:39,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:39,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487894310] [2022-02-20 23:44:39,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:39,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:39,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:39,611 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:44:39,639 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:44:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:39,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:44:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:39,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:39,765 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:44:39,766 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 1 case distinctions, treesize of input 9 treesize of output 14 [2022-02-20 23:44:39,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {53#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(14bv32, 2bv32); {53#true} is VALID [2022-02-20 23:44:39,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {53#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {61#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:44:39,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {61#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[alloc_data_~pdata#1.base]); {54#false} is VALID [2022-02-20 23:44:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:39,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:39,802 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:39,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487894310] [2022-02-20 23:44:39,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487894310] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:39,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:39,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:39,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785406722] [2022-02-20 23:44:39,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:39,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:44:39,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:39,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:39,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:39,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:39,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:39,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:39,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:39,831 INFO L87 Difference]: Start difference. First operand has 50 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:39,982 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-02-20 23:44:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:39,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:44:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 23:44:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 23:44:39,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-02-20 23:44:40,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:40,050 INFO L225 Difference]: With dead ends: 48 [2022-02-20 23:44:40,051 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 23:44:40,051 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:44:40,054 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:40,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 32 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:40,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 23:44:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 23:44:40,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:40,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,072 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,073 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,075 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-02-20 23:44:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:44:40,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:40,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:40,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 states. [2022-02-20 23:44:40,077 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 states. [2022-02-20 23:44:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,079 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-02-20 23:44:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:44:40,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:40,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:40,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:40,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-02-20 23:44:40,095 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 3 [2022-02-20 23:44:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:40,096 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-02-20 23:44:40,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:44:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:40,096 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:40,096 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:40,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:44:40,303 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:44:40,303 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:40,304 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:44:40,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:40,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709971618] [2022-02-20 23:44:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:40,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:40,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:40,306 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:44:40,307 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:44:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:40,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:44:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:40,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:40,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:40,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:44:40,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:44:40,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {250#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(14bv32, 2bv32); {250#true} is VALID [2022-02-20 23:44:40,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {250#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {258#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:44:40,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, alloc_data_~pdata#1.offset), #length[alloc_data_~pdata#1.base]) && ~bvule32(alloc_data_~pdata#1.offset, ~bvadd32(4bv32, alloc_data_~pdata#1.offset))) && ~bvule32(0bv32, alloc_data_~pdata#1.offset)); {251#false} is VALID [2022-02-20 23:44:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:40,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:40,474 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:40,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709971618] [2022-02-20 23:44:40,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709971618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:40,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:40,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:40,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551359508] [2022-02-20 23:44:40,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:40,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:44:40,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:40,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:40,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:40,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:40,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:40,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:40,485 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,640 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-02-20 23:44:40,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:40,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:44:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 23:44:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 23:44:40,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-02-20 23:44:40,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:40,689 INFO L225 Difference]: With dead ends: 45 [2022-02-20 23:44:40,690 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 23:44:40,690 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:44:40,691 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:40,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:40,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 23:44:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 23:44:40,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:40,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,694 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,695 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,696 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-02-20 23:44:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-02-20 23:44:40,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:40,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:40,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 states. [2022-02-20 23:44:40,698 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 states. [2022-02-20 23:44:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,700 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-02-20 23:44:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-02-20 23:44:40,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:40,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:40,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:40,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-02-20 23:44:40,702 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 3 [2022-02-20 23:44:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:40,703 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-02-20 23:44:40,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-02-20 23:44:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:44:40,703 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:40,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:44:40,723 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:44:40,911 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:44:40,911 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-02-20 23:44:40,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:40,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690532122] [2022-02-20 23:44:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:40,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:40,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:40,915 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:44:40,922 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:44:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:40,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:44:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:40,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:41,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:41,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:44:41,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:44:41,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:41,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:44:41,078 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:44:41,079 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:44:41,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {441#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(14bv32, 2bv32); {441#true} is VALID [2022-02-20 23:44:41,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {449#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:44:41,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {453#(and (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:44:41,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {453#(and (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {449#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:44:41,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {449#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, alloc_data_~pdata#1.offset)), #length[alloc_data_~pdata#1.base]) && ~bvule32(~bvadd32(4bv32, alloc_data_~pdata#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, alloc_data_~pdata#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, alloc_data_~pdata#1.offset))); {442#false} is VALID [2022-02-20 23:44:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:41,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:41,092 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:41,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690532122] [2022-02-20 23:44:41,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690532122] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:41,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:41,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:41,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191817641] [2022-02-20 23:44:41,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:41,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:41,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:41,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:41,101 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:44:41,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:44:41,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:41,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:44:41,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:41,102 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:41,275 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:44:41,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:44:41,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 23:44:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 23:44:41,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-02-20 23:44:41,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:41,329 INFO L225 Difference]: With dead ends: 44 [2022-02-20 23:44:41,329 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 23:44:41,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:41,330 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 67 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:41,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 23 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 23:44:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 23:44:41,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:41,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,333 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,333 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:41,334 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:44:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:44:41,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:41,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:41,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 states. [2022-02-20 23:44:41,335 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 states. [2022-02-20 23:44:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:41,336 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:44:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:44:41,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:41,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:41,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:41,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-02-20 23:44:41,337 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 5 [2022-02-20 23:44:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:41,338 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-02-20 23:44:41,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:44:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:44:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:41,338 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:41,338 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:41,356 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:44:41,538 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:44:41,539 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:41,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:41,539 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2022-02-20 23:44:41,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:41,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759359662] [2022-02-20 23:44:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:41,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:41,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:41,543 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:44:41,545 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:44:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:41,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:44:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:41,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:41,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {635#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(14bv32, 2bv32); {635#true} is VALID [2022-02-20 23:44:41,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {635#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {643#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:44:41,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {643#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {643#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:44:41,665 INFO L290 TraceCheckUtils]: 3: Hoare triple {643#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {643#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:44:41,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {643#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {653#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:44:41,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {653#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {653#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:44:41,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {653#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} assume { :end_inline_alloc_data } true; {653#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:44:41,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~#data~0#1.base]); {636#false} is VALID [2022-02-20 23:44:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:41,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:41,667 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:41,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759359662] [2022-02-20 23:44:41,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759359662] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:41,668 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:41,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:41,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632843465] [2022-02-20 23:44:41,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:41,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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:44:41,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:41,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 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:44:41,677 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:44:41,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:44:41,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:41,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:44:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:41,678 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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:44:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:41,829 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-02-20 23:44:41,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:44:41,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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:44:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) 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:44:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 23:44:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) 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:44:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 23:44:41,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-02-20 23:44:41,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:41,878 INFO L225 Difference]: With dead ends: 42 [2022-02-20 23:44:41,878 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 23:44:41,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:44:41,879 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:41,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 28 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 23:44:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-20 23:44:41,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:41,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,881 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,881 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:41,882 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-02-20 23:44:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-02-20 23:44:41,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:41,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:41,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 states. [2022-02-20 23:44:41,883 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 states. [2022-02-20 23:44:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:41,884 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-02-20 23:44:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-02-20 23:44:41,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:41,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:41,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:41,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-02-20 23:44:41,886 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 8 [2022-02-20 23:44:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:41,886 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-02-20 23:44:41,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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:44:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-02-20 23:44:41,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:41,887 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:41,887 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:41,903 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:44:42,093 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:44:42,093 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:42,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2022-02-20 23:44:42,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:42,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434026861] [2022-02-20 23:44:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:42,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:42,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:42,096 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:44:42,097 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:44:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:42,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:44:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:42,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:42,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {832#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(14bv32, 2bv32); {832#true} is VALID [2022-02-20 23:44:42,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {832#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {840#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:42,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {840#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:42,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {840#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {840#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:42,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {840#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {850#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:42,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {850#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {850#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:42,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {850#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume { :end_inline_alloc_data } true; {850#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:42,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, main_~#data~0#1.offset), #length[main_~#data~0#1.base]) && ~bvule32(main_~#data~0#1.offset, ~bvadd32(4bv32, main_~#data~0#1.offset))) && ~bvule32(0bv32, main_~#data~0#1.offset)); {833#false} is VALID [2022-02-20 23:44:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:42,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:42,259 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:42,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434026861] [2022-02-20 23:44:42,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434026861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:42,260 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:42,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:42,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499918997] [2022-02-20 23:44:42,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:42,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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:44:42,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:42,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 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:44:42,270 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:44:42,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:44:42,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:42,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:44:42,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:42,271 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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:44:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:42,412 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-02-20 23:44:42,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:42,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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:44:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) 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:44:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 23:44:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) 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:44:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 23:44:42,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-02-20 23:44:42,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:42,465 INFO L225 Difference]: With dead ends: 40 [2022-02-20 23:44:42,465 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 23:44:42,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:44:42,466 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 64 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:42,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 28 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 23:44:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 23:44:42,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:42,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,468 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,468 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:42,469 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-02-20 23:44:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-02-20 23:44:42,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:42,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:42,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 states. [2022-02-20 23:44:42,470 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 states. [2022-02-20 23:44:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:42,470 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-02-20 23:44:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-02-20 23:44:42,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:42,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:42,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:42,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-02-20 23:44:42,472 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 8 [2022-02-20 23:44:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:42,472 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-02-20 23:44:42,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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:44:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-02-20 23:44:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:44:42,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:42,473 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:42,479 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:44:42,679 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:44:42,679 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:42,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1604044760, now seen corresponding path program 1 times [2022-02-20 23:44:42,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:42,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144302193] [2022-02-20 23:44:42,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:42,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:42,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:42,682 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:44:42,683 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:44:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:42,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:44:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:42,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:42,768 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:44:42,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {1021#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(14bv32, 2bv32); {1021#true} is VALID [2022-02-20 23:44:42,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {1021#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {1021#true} is VALID [2022-02-20 23:44:42,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {1021#true} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1021#true} is VALID [2022-02-20 23:44:42,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {1021#true} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {1021#true} is VALID [2022-02-20 23:44:42,773 INFO L290 TraceCheckUtils]: 4: Hoare triple {1021#true} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1021#true} is VALID [2022-02-20 23:44:42,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {1021#true} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1021#true} is VALID [2022-02-20 23:44:42,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {1021#true} assume { :end_inline_alloc_data } true; {1021#true} is VALID [2022-02-20 23:44:42,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {1021#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L544 {1021#true} is VALID [2022-02-20 23:44:42,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {1021#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L544-1 {1021#true} is VALID [2022-02-20 23:44:42,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {1021#true} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {1053#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|))} is VALID [2022-02-20 23:44:42,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {1053#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|))} assume !(1bv1 == #valid[free_data_~#data#1.base]); {1022#false} is VALID [2022-02-20 23:44:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:42,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:42,775 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:42,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144302193] [2022-02-20 23:44:42,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144302193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:42,775 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:42,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:42,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314047417] [2022-02-20 23:44:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:42,776 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:44:42,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:42,776 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:44:42,789 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:44:42,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:42,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:42,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:42,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:42,790 INFO L87 Difference]: Start difference. First operand 40 states and 40 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:44:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:42,904 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 23:44:42,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:42,904 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:44:42,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:42,904 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:44:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-02-20 23:44:42,905 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:44:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-02-20 23:44:42,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-02-20 23:44:42,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:42,940 INFO L225 Difference]: With dead ends: 36 [2022-02-20 23:44:42,941 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 23:44:42,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:44:42,942 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:42,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 31 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 23:44:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 23:44:42,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:42,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,943 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,944 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:42,944 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 23:44:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-02-20 23:44:42,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:42,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:42,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 states. [2022-02-20 23:44:42,945 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 states. [2022-02-20 23:44:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:42,945 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 23:44:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-02-20 23:44:42,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:42,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:42,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:42,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-02-20 23:44:42,947 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 11 [2022-02-20 23:44:42,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:42,947 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-02-20 23:44:42,948 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:44:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-02-20 23:44:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:44:42,948 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:42,948 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:42,954 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:44:43,154 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:44:43,154 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:43,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:43,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1604044759, now seen corresponding path program 1 times [2022-02-20 23:44:43,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:43,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415789473] [2022-02-20 23:44:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:43,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:43,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:43,156 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:44:43,163 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:44:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:43,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:44:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:43,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:43,242 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:44:43,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {1200#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(14bv32, 2bv32); {1200#true} is VALID [2022-02-20 23:44:43,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {1200#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {1200#true} is VALID [2022-02-20 23:44:43,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {1200#true} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1200#true} is VALID [2022-02-20 23:44:43,249 INFO L290 TraceCheckUtils]: 3: Hoare triple {1200#true} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {1200#true} is VALID [2022-02-20 23:44:43,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {1200#true} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1200#true} is VALID [2022-02-20 23:44:43,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {1200#true} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1200#true} is VALID [2022-02-20 23:44:43,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {1200#true} assume { :end_inline_alloc_data } true; {1200#true} is VALID [2022-02-20 23:44:43,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {1200#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L544 {1200#true} is VALID [2022-02-20 23:44:43,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {1200#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L544-1 {1200#true} is VALID [2022-02-20 23:44:43,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {1200#true} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {1232#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (= |ULTIMATE.start_free_data_~#data#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:44:43,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {1232#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (= |ULTIMATE.start_free_data_~#data#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, free_data_~#data#1.offset), #length[free_data_~#data#1.base]) && ~bvule32(free_data_~#data#1.offset, ~bvadd32(4bv32, free_data_~#data#1.offset))) && ~bvule32(0bv32, free_data_~#data#1.offset)); {1201#false} is VALID [2022-02-20 23:44:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:43,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:43,252 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:43,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415789473] [2022-02-20 23:44:43,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415789473] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:43,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:43,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:43,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138344823] [2022-02-20 23:44:43,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:43,253 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:44:43,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:43,253 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:44:43,265 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:44:43,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:43,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:43,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:43,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:43,266 INFO L87 Difference]: Start difference. First operand 36 states and 36 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:44:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:43,357 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-02-20 23:44:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:43,357 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:44:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:43,357 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:44:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-20 23:44:43,358 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:44:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-20 23:44:43,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-02-20 23:44:43,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:43,392 INFO L225 Difference]: With dead ends: 32 [2022-02-20 23:44:43,392 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 23:44:43,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:44:43,394 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:43,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 23:44:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 23:44:43,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:43,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,396 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,396 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:43,397 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-02-20 23:44:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-02-20 23:44:43,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:43,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:43,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 states. [2022-02-20 23:44:43,397 INFO L87 Difference]: Start difference. First operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 states. [2022-02-20 23:44:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:43,398 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-02-20 23:44:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-02-20 23:44:43,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:43,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:43,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:43,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-02-20 23:44:43,399 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 11 [2022-02-20 23:44:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:43,400 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-02-20 23:44:43,400 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:44:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-02-20 23:44:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:44:43,400 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:43,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:43,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:43,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:43,607 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:43,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash -353452457, now seen corresponding path program 1 times [2022-02-20 23:44:43,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:43,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903109340] [2022-02-20 23:44:43,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:43,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:43,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:43,609 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:43,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:44:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:43,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:44:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:43,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:43,765 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 11 treesize of output 7 [2022-02-20 23:44:43,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:43,818 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 21 treesize of output 20 [2022-02-20 23:44:43,917 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:44:43,917 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-02-20 23:44:43,984 INFO L356 Elim1Store]: treesize reduction 50, result has 33.3 percent of original size [2022-02-20 23:44:43,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2022-02-20 23:44:44,035 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:44:44,035 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 28 treesize of output 16 [2022-02-20 23:44:44,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {1363#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(14bv32, 2bv32); {1363#true} is VALID [2022-02-20 23:44:44,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {1371#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:44:44,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {1371#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1375#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:44:44,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {1375#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {1375#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:44:44,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {1375#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1382#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:44:44,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {1382#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (_ bv0 32)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1382#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:44:44,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {1382#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (_ bv0 32)))} assume { :end_inline_alloc_data } true; {1382#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:44:44,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {1382#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (_ bv0 32)))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L544 {1392#(exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_#t~mem7#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) (_ bv0 32))))} is VALID [2022-02-20 23:44:44,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {1392#(exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_#t~mem7#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) (_ bv0 32))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L544-1 {1392#(exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_#t~mem7#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) (_ bv0 32))))} is VALID [2022-02-20 23:44:44,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {1392#(exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_#t~mem7#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) (_ bv0 32))))} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {1399#(exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_free_data_#in~data#1.lo.offset|)))} is VALID [2022-02-20 23:44:45,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {1399#(exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_free_data_#in~data#1.lo.offset|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532 {1403#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (_ bv0 32)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))))} is VALID [2022-02-20 23:44:45,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {1403#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (_ bv0 32)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L532-1 {1407#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (_ bv0 32)) (or (= (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32)) (_ bv0 32)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) (_ bv0 32)))))} is VALID [2022-02-20 23:44:45,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {1407#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (_ bv0 32)) (or (= (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32)) (_ bv0 32)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv0 32)) (_ bv0 32)))))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532-2 {1411#(= |ULTIMATE.start_free_data_#t~mem5#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:44:45,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {1411#(= |ULTIMATE.start_free_data_#t~mem5#1.offset| (_ bv0 32))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {1415#(= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:44:45,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {1415#(= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32))} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L535 {1415#(= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:44:45,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {1415#(= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {1415#(= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:44:45,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {1415#(= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32))} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {1415#(= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:44:45,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {1415#(= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32))} assume !(0bv32 == free_data_~lo~0#1.offset); {1364#false} is VALID [2022-02-20 23:44:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:45,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:45,845 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:45,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903109340] [2022-02-20 23:44:45,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903109340] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:45,845 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:45,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:44:45,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137293337] [2022-02-20 23:44:45,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:45,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:44:45,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:45,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:48,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:48,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:44:48,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:48,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:44:48,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:44:48,709 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,656 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:44:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:44:52,656 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 23:44:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. [2022-02-20 23:44:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. [2022-02-20 23:44:52,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 32 transitions. [2022-02-20 23:44:55,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:55,357 INFO L225 Difference]: With dead ends: 31 [2022-02-20 23:44:55,357 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 23:44:55,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:44:55,358 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:55,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 136 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-02-20 23:44:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 23:44:55,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 23:44:55,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:55,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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:44:55,359 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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:44:55,359 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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:44:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:55,360 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:44:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:44:55,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:55,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:55,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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) Second operand 31 states. [2022-02-20 23:44:55,361 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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) Second operand 31 states. [2022-02-20 23:44:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:55,361 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:44:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:44:55,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:55,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:55,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:55,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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:44:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-02-20 23:44:55,362 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 18 [2022-02-20 23:44:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:55,362 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-02-20 23:44:55,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:44:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:44:55,363 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:55,363 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:44:55,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:44:55,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:55,572 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:44:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:55,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1927874256, now seen corresponding path program 1 times [2022-02-20 23:44:55,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:55,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722106752] [2022-02-20 23:44:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:55,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:55,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:55,574 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:55,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:44:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:55,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 23:44:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:55,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:55,693 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:44:55,694 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:44:55,725 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 11 treesize of output 7 [2022-02-20 23:44:55,757 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 23:44:55,757 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 15 treesize of output 15 [2022-02-20 23:44:55,827 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:44:55,828 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-02-20 23:44:56,004 INFO L356 Elim1Store]: treesize reduction 54, result has 33.3 percent of original size [2022-02-20 23:44:56,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-02-20 23:44:56,539 INFO L356 Elim1Store]: treesize reduction 108, result has 23.9 percent of original size [2022-02-20 23:44:56,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 63 [2022-02-20 23:44:56,852 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 23:44:56,852 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 31 treesize of output 11 [2022-02-20 23:44:56,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {1555#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(14bv32, 2bv32); {1555#true} is VALID [2022-02-20 23:44:56,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {1563#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:56,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {1563#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1567#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:56,906 INFO L290 TraceCheckUtils]: 3: Hoare triple {1567#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {1571#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_alloc_data_#t~malloc4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:44:56,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {1571#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_alloc_data_#t~malloc4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1575#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))} is VALID [2022-02-20 23:44:56,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {1575#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1575#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))} is VALID [2022-02-20 23:44:56,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {1575#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))} assume { :end_inline_alloc_data } true; {1575#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))} is VALID [2022-02-20 23:44:56,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {1575#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L544 {1585#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} is VALID [2022-02-20 23:44:56,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {1585#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L544-1 {1589#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_#t~mem8#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))))} is VALID [2022-02-20 23:44:56,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {1589#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_#t~mem8#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))))} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {1593#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_free_data_#in~data#1.hi.base|)))} is VALID [2022-02-20 23:44:58,923 WARN L290 TraceCheckUtils]: 10: Hoare triple {1593#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_free_data_#in~data#1.hi.base|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532 {1597#(and (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (or (and (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|) (= |ULTIMATE.start_free_data_~#data#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_free_data_#in~data#1.hi.base|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_#in~data#1.hi.base|)))} is UNKNOWN [2022-02-20 23:44:58,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {1597#(and (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (or (and (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|) (= |ULTIMATE.start_free_data_~#data#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_free_data_#in~data#1.hi.base|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_#in~data#1.hi.base|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L532-1 {1601#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32)))))} is VALID [2022-02-20 23:44:58,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {1601#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32)))))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532-2 {1605#(and (= |ULTIMATE.start_free_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))))} is VALID [2022-02-20 23:44:58,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {1605#(and (= |ULTIMATE.start_free_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {1609#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_~lo~0#1.base|))} is VALID [2022-02-20 23:44:58,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {1609#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_~lo~0#1.base|))} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L535 {1613#(not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_#t~mem6#1.base|))} is VALID [2022-02-20 23:44:58,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {1613#(not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_#t~mem6#1.base|))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {1617#(not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|))} is VALID [2022-02-20 23:44:58,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {1617#(not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|))} assume free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset;call ULTIMATE.dealloc(free_data_~#data#1.base, free_data_~#data#1.offset);havoc free_data_~#data#1.base, free_data_~#data#1.offset; {1556#false} is VALID [2022-02-20 23:44:58,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {1556#false} assume { :end_inline_free_data } true;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#res#1 := 0bv32;call ULTIMATE.dealloc(main_~#data~0#1.base, main_~#data~0#1.offset);havoc main_~#data~0#1.base, main_~#data~0#1.offset; {1556#false} is VALID [2022-02-20 23:44:58,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {1556#false} assume !(#valid == main_old_#valid#1); {1556#false} is VALID [2022-02-20 23:44:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:58,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:58,928 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:58,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722106752] [2022-02-20 23:44:58,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722106752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:58,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:58,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 23:44:58,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083179162] [2022-02-20 23:44:58,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:58,929 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:44:58,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:58,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:45:00,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:00,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:45:00,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:00,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:45:00,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:45:00,973 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:45:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:01,952 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2022-02-20 23:45:01,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:45:01,952 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:45:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:45:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-02-20 23:45:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:45:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-02-20 23:45:01,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-02-20 23:45:06,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 29 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:06,069 INFO L225 Difference]: With dead ends: 31 [2022-02-20 23:45:06,069 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 23:45:06,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:45:06,069 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:06,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 82 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 152 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2022-02-20 23:45:06,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 23:45:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 23:45:06,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:06,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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:45:06,071 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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:45:06,071 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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:45:06,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:06,072 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2022-02-20 23:45:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2022-02-20 23:45:06,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:06,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:06,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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) Second operand 31 states. [2022-02-20 23:45:06,072 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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) Second operand 31 states. [2022-02-20 23:45:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:06,072 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2022-02-20 23:45:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2022-02-20 23:45:06,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:06,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:06,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:06,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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:45:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2022-02-20 23:45:06,073 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 19 [2022-02-20 23:45:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:06,073 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2022-02-20 23:45:06,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:45:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2022-02-20 23:45:06,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:45:06,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:06,074 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:45:06,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:06,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:45:06,274 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:45:06,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:06,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1927875793, now seen corresponding path program 1 times [2022-02-20 23:45:06,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:06,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770599668] [2022-02-20 23:45:06,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:06,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:06,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:06,277 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:45:06,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:45:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:06,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:45:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:06,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:06,425 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 11 treesize of output 7 [2022-02-20 23:45:06,474 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:45:06,475 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:45:06,572 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:45:06,572 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-02-20 23:45:06,614 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:45:06,614 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:45:06,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:45:06,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {1766#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(14bv32, 2bv32); {1766#true} is VALID [2022-02-20 23:45:06,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {1766#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {1774#(and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:45:06,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {1774#(and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1778#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) |#StackHeapBarrier|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:45:06,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {1778#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) |#StackHeapBarrier|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {1778#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) |#StackHeapBarrier|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:45:06,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {1778#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) |#StackHeapBarrier|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1785#(bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:06,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {1785#(bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |#StackHeapBarrier|)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1785#(bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:06,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {1785#(bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |#StackHeapBarrier|)} assume { :end_inline_alloc_data } true; {1785#(bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:06,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {1785#(bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L544 {1795#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:45:06,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {1795#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |#StackHeapBarrier|)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L544-1 {1795#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:45:06,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {1795#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |#StackHeapBarrier|)))} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {1802#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:45:06,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {1802#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |#StackHeapBarrier|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532 {1806#(bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:06,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {1806#(bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L532-1 {1806#(bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:06,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {1806#(bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |#StackHeapBarrier|)} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532-2 {1813#(bvult |ULTIMATE.start_free_data_#t~mem5#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:06,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {1813#(bvult |ULTIMATE.start_free_data_#t~mem5#1.base| |#StackHeapBarrier|)} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {1817#(bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:06,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {1817#(bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|)} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L535 {1817#(bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:06,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {1817#(bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|)} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {1817#(bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:06,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|)} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {1817#(bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:06,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|)} assume 0bv32 == free_data_~lo~0#1.offset; {1817#(bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:06,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {1817#(bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|)} assume !~bvult32(free_data_~lo~0#1.base, #StackHeapBarrier); {1767#false} is VALID [2022-02-20 23:45:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:06,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:06,721 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:06,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770599668] [2022-02-20 23:45:06,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770599668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:06,721 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:06,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:45:06,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838120994] [2022-02-20 23:45:06,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:06,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:45:06,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:06,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:45:06,766 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:45:06,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:45:06,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:06,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:45:06,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:06,767 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:45:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:07,267 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-02-20 23:45:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:45:07,267 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:45:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:45:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-02-20 23:45:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:45:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-02-20 23:45:07,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 30 transitions. [2022-02-20 23:45:07,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:07,329 INFO L225 Difference]: With dead ends: 30 [2022-02-20 23:45:07,329 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:45:07,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:45:07,330 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:07,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 57 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-02-20 23:45:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:45:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 23:45:07,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:07,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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:45:07,331 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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:45:07,331 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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:45:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:07,332 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-02-20 23:45:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2022-02-20 23:45:07,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:07,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:07,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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) Second operand 30 states. [2022-02-20 23:45:07,333 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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) Second operand 30 states. [2022-02-20 23:45:07,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:07,333 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-02-20 23:45:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2022-02-20 23:45:07,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:07,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:07,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:07,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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:45:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 29 transitions. [2022-02-20 23:45:07,334 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 29 transitions. Word has length 19 [2022-02-20 23:45:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:07,334 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 29 transitions. [2022-02-20 23:45:07,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:45:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2022-02-20 23:45:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:45:07,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:07,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:07,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:07,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:45:07,541 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:45:07,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:07,542 INFO L85 PathProgramCache]: Analyzing trace with hash -365392487, now seen corresponding path program 1 times [2022-02-20 23:45:07,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:07,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020596058] [2022-02-20 23:45:07,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:07,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:07,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:07,544 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:45:07,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:45:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:07,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 43 conjunts are in the unsatisfiable core [2022-02-20 23:45:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:07,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:07,671 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:45:07,672 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:45:07,704 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 11 treesize of output 7 [2022-02-20 23:45:07,751 INFO L356 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2022-02-20 23:45:07,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2022-02-20 23:45:07,804 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:45:07,804 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2022-02-20 23:45:07,812 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:45:07,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:45:08,011 INFO L356 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2022-02-20 23:45:08,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 46 [2022-02-20 23:45:08,161 INFO L356 Elim1Store]: treesize reduction 54, result has 33.3 percent of original size [2022-02-20 23:45:08,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 50 [2022-02-20 23:45:09,034 INFO L356 Elim1Store]: treesize reduction 108, result has 23.9 percent of original size [2022-02-20 23:45:09,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 72 [2022-02-20 23:45:09,204 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:45:09,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:45:09,427 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 23:45:09,427 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 44 treesize of output 20 [2022-02-20 23:45:09,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {1960#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(14bv32, 2bv32); {1960#true} is VALID [2022-02-20 23:45:09,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {1968#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:45:09,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {1968#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1972#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:45:09,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {1972#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {1976#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (or (= |ULTIMATE.start_alloc_data_#t~malloc4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1)))) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:45:09,813 INFO L290 TraceCheckUtils]: 4: Hoare triple {1976#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (or (= |ULTIMATE.start_alloc_data_#t~malloc4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1)))) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1980#(and (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:45:09,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {1980#(and (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1980#(and (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:45:09,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {1980#(and (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} assume { :end_inline_alloc_data } true; {1980#(and (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:45:09,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {1980#(and (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L544 {1990#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:45:09,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {1990#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L544-1 {1994#(and (= (_ bv0 32) |ULTIMATE.start_main_#t~mem8#1.offset|) (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_#t~mem8#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))))} is VALID [2022-02-20 23:45:09,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {1994#(and (= (_ bv0 32) |ULTIMATE.start_main_#t~mem8#1.offset|) (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_#t~mem8#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))))} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {1998#(and (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|)) (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_free_data_#in~data#1.hi.base|))))} is VALID [2022-02-20 23:45:11,824 WARN L290 TraceCheckUtils]: 10: Hoare triple {1998#(and (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|)) (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_free_data_#in~data#1.hi.base|))))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532 {2002#(and (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.hi.base|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (_ bv1 1)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (or (and (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|) (= |ULTIMATE.start_free_data_~#data#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_free_data_#in~data#1.hi.base|)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|)))} is UNKNOWN [2022-02-20 23:45:11,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {2002#(and (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.hi.base|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (_ bv1 1)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (or (and (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|) (= |ULTIMATE.start_free_data_~#data#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_free_data_#in~data#1.hi.base|)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L532-1 {2006#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32)) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|))))} is VALID [2022-02-20 23:45:11,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {2006#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32)) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|))))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532-2 {2010#(and (= |ULTIMATE.start_free_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32)) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|))))} is VALID [2022-02-20 23:45:11,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {2010#(and (= |ULTIMATE.start_free_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32)) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|))))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {2014#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_~lo~0#1.base|) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|))))} is VALID [2022-02-20 23:45:11,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {2014#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_~lo~0#1.base|) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|))))} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L535 {2018#(and (or (= (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|))) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_#t~mem6#1.base|)) (exists ((|ULTIMATE.start_free_data_~#data#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|)))) (= |ULTIMATE.start_free_data_#t~mem6#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:45:11,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {2018#(and (or (= (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|))) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_#t~mem6#1.base|)) (exists ((|ULTIMATE.start_free_data_~#data#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|)))) (= |ULTIMATE.start_free_data_#t~mem6#1.offset| (_ bv0 32)))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {2022#(and (exists ((|ULTIMATE.start_free_data_~#data#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|)))) (= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32)) (or (= (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|))) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)))} is VALID [2022-02-20 23:45:11,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {2022#(and (exists ((|ULTIMATE.start_free_data_~#data#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|)))) (= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32)) (or (= (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|))) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)))} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {2026#(and (exists ((|ULTIMATE.start_free_data_~#data#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|)))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|)))))) (not (= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32)))))} is VALID [2022-02-20 23:45:11,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {2026#(and (exists ((|ULTIMATE.start_free_data_~#data#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|)))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|)))))) (not (= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32)))))} assume 0bv32 == free_data_~lo~0#1.offset; {2030#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|))))))} is VALID [2022-02-20 23:45:11,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {2030#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|))))))} assume ~bvult32(free_data_~lo~0#1.base, #StackHeapBarrier); {2030#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|))))))} is VALID [2022-02-20 23:45:11,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {2030#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|))))))} assume !(0bv32 == free_data_~lo~0#1.base || 1bv1 == #valid[free_data_~lo~0#1.base]); {1961#false} is VALID [2022-02-20 23:45:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:11,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:11,842 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:11,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020596058] [2022-02-20 23:45:11,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020596058] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:11,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:11,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-20 23:45:11,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010764024] [2022-02-20 23:45:11,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:11,843 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 23:45:11,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:11,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:13,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:13,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 23:45:13,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:13,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 23:45:13,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:45:13,995 INFO L87 Difference]: Start difference. First operand 30 states and 29 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:15,213 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:45:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:45:15,213 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 23:45:15,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2022-02-20 23:45:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2022-02-20 23:45:15,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 29 transitions. [2022-02-20 23:45:19,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 27 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:19,298 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:45:19,298 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 23:45:19,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-02-20 23:45:19,299 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:19,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 81 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 112 Unchecked, 0.3s Time] [2022-02-20 23:45:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 23:45:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 23:45:19,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:19,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:19,300 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:19,300 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:19,301 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:45:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2022-02-20 23:45:19,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:19,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:19,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 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 29 states. [2022-02-20 23:45:19,301 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 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 29 states. [2022-02-20 23:45:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:19,302 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:45:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2022-02-20 23:45:19,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:19,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:19,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:19,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2022-02-20 23:45:19,302 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 20 [2022-02-20 23:45:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:19,303 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2022-02-20 23:45:19,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2022-02-20 23:45:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:45:19,303 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:19,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:19,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:19,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:45:19,510 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:45:19,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:19,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1557734867, now seen corresponding path program 1 times [2022-02-20 23:45:19,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:19,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856204692] [2022-02-20 23:45:19,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:19,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:19,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:19,512 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:45:19,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:45:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:19,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:45:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:19,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:19,654 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:45:19,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:45:19,725 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:45:19,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:45:19,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {2172#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(14bv32, 2bv32); {2172#true} is VALID [2022-02-20 23:45:19,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {2172#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {2180#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:45:19,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {2180#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {2180#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:45:19,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {2180#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {2187#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:45:19,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {2187#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {2191#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32))} is VALID [2022-02-20 23:45:19,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {2191#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2191#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32))} is VALID [2022-02-20 23:45:19,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {2191#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32))} assume { :end_inline_alloc_data } true; {2191#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32))} is VALID [2022-02-20 23:45:19,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {2191#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L544 {2191#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32))} is VALID [2022-02-20 23:45:19,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {2191#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L544-1 {2204#(= (_ bv0 32) |ULTIMATE.start_main_#t~mem8#1.offset|)} is VALID [2022-02-20 23:45:19,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {2204#(= (_ bv0 32) |ULTIMATE.start_main_#t~mem8#1.offset|)} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {2208#(= |ULTIMATE.start_free_data_#in~data#1.hi.offset| (_ bv0 32))} is VALID [2022-02-20 23:45:19,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {2208#(= |ULTIMATE.start_free_data_#in~data#1.hi.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532 {2208#(= |ULTIMATE.start_free_data_#in~data#1.hi.offset| (_ bv0 32))} is VALID [2022-02-20 23:45:19,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {2208#(= |ULTIMATE.start_free_data_#in~data#1.hi.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L532-1 {2215#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32))} is VALID [2022-02-20 23:45:19,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {2215#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532-2 {2215#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32))} is VALID [2022-02-20 23:45:19,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {2215#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {2215#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32))} is VALID [2022-02-20 23:45:19,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {2215#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32))} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L535 {2225#(= |ULTIMATE.start_free_data_#t~mem6#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:45:19,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {2225#(= |ULTIMATE.start_free_data_#t~mem6#1.offset| (_ bv0 32))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {2229#(= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:45:19,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {2229#(= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32))} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {2229#(= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:45:19,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {2229#(= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32))} assume 0bv32 == free_data_~lo~0#1.offset; {2229#(= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:45:19,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {2229#(= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32))} assume ~bvult32(free_data_~lo~0#1.base, #StackHeapBarrier); {2229#(= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:45:19,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {2229#(= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32))} assume 0bv32 == free_data_~lo~0#1.base || 1bv1 == #valid[free_data_~lo~0#1.base];call ULTIMATE.dealloc(free_data_~lo~0#1.base, free_data_~lo~0#1.offset); {2229#(= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:45:19,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {2229#(= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32))} assume !(0bv32 == free_data_~hi~0#1.offset); {2173#false} is VALID [2022-02-20 23:45:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:19,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:19,837 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:19,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856204692] [2022-02-20 23:45:19,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856204692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:19,837 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:19,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:45:19,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948063042] [2022-02-20 23:45:19,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:19,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 23:45:19,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:19,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:19,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:19,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:45:19,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:19,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:45:19,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:19,875 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:20,589 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2022-02-20 23:45:20,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:45:20,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 23:45:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-02-20 23:45:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-02-20 23:45:20,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-02-20 23:45:20,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:20,649 INFO L225 Difference]: With dead ends: 28 [2022-02-20 23:45:20,649 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 23:45:20,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:45:20,649 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:20,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 70 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 23:45:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 23:45:20,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:20,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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:45:20,651 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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:45:20,652 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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:45:20,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:20,652 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2022-02-20 23:45:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2022-02-20 23:45:20,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:20,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:20,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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) Second operand 28 states. [2022-02-20 23:45:20,656 INFO L87 Difference]: Start difference. First operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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) Second operand 28 states. [2022-02-20 23:45:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:20,656 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2022-02-20 23:45:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2022-02-20 23:45:20,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:20,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:20,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:20,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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:45:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2022-02-20 23:45:20,658 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 21 [2022-02-20 23:45:20,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:20,658 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2022-02-20 23:45:20,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2022-02-20 23:45:20,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:45:20,659 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:20,659 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:20,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:20,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:45:20,866 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:45:20,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:20,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1045140699, now seen corresponding path program 1 times [2022-02-20 23:45:20,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:20,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027143519] [2022-02-20 23:45:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:20,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:20,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:20,869 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:45:20,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:45:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:20,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:45:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:20,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:21,177 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:45:21,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:45:21,418 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:45:21,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:45:21,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {2376#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(14bv32, 2bv32); {2381#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:21,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {2381#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {2385#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:21,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {2385#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {2385#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:21,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {2385#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {2392#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))) (bvult |ULTIMATE.start_alloc_data_#t~malloc4#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:45:23,757 WARN L290 TraceCheckUtils]: 4: Hoare triple {2392#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))) (bvult |ULTIMATE.start_alloc_data_#t~malloc4#1.base| |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {2396#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is UNKNOWN [2022-02-20 23:45:23,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {2396#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2396#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {2396#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} assume { :end_inline_alloc_data } true; {2396#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {2396#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L544 {2396#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {2396#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L544-1 {2409#(and (bvult |ULTIMATE.start_main_#t~mem8#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {2409#(and (bvult |ULTIMATE.start_main_#t~mem8#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {2413#(and (bvult |ULTIMATE.start_free_data_#in~data#1.hi.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {2413#(and (bvult |ULTIMATE.start_free_data_#in~data#1.hi.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532 {2413#(and (bvult |ULTIMATE.start_free_data_#in~data#1.hi.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {2413#(and (bvult |ULTIMATE.start_free_data_#in~data#1.hi.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L532-1 {2420#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {2420#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532-2 {2420#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {2420#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {2420#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {2420#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L535 {2430#(and (bvult |ULTIMATE.start_free_data_#t~mem6#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {2430#(and (bvult |ULTIMATE.start_free_data_#t~mem6#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {2434#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {2434#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {2434#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {2434#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} assume 0bv32 == free_data_~lo~0#1.offset; {2434#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {2434#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} assume ~bvult32(free_data_~lo~0#1.base, #StackHeapBarrier); {2434#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {2434#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} assume 0bv32 == free_data_~lo~0#1.base || 1bv1 == #valid[free_data_~lo~0#1.base];call ULTIMATE.dealloc(free_data_~lo~0#1.base, free_data_~lo~0#1.offset); {2434#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {2434#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} assume 0bv32 == free_data_~hi~0#1.offset; {2434#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:45:23,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {2434#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} assume !~bvult32(free_data_~hi~0#1.base, #StackHeapBarrier); {2377#false} is VALID [2022-02-20 23:45:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:23,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:23,825 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:23,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027143519] [2022-02-20 23:45:23,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027143519] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:23,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:23,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:45:23,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115369583] [2022-02-20 23:45:23,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:23,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:45:23,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:23,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:23,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:23,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:45:23,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:23,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:45:23,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:45:23,941 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,106 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2022-02-20 23:45:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:45:24,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:45:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2022-02-20 23:45:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2022-02-20 23:45:24,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 27 transitions. [2022-02-20 23:45:24,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:24,306 INFO L225 Difference]: With dead ends: 27 [2022-02-20 23:45:24,306 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 23:45:24,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:45:24,307 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:24,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-02-20 23:45:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 23:45:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 23:45:24,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:24,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 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:45:24,308 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 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:45:24,308 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 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:45:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,309 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2022-02-20 23:45:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2022-02-20 23:45:24,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:24,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:24,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 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) Second operand 27 states. [2022-02-20 23:45:24,312 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 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) Second operand 27 states. [2022-02-20 23:45:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,313 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2022-02-20 23:45:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2022-02-20 23:45:24,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:24,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:24,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:24,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 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:45:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2022-02-20 23:45:24,314 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2022-02-20 23:45:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:24,314 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2022-02-20 23:45:24,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2022-02-20 23:45:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:45:24,315 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:24,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:24,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:24,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:45:24,523 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:45:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1960376619, now seen corresponding path program 1 times [2022-02-20 23:45:24,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:24,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565676591] [2022-02-20 23:45:24,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:24,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:24,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:24,525 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:45:24,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:45:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:24,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:45:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:24,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:24,649 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:45:24,683 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:45:24,688 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:45:24,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-02-20 23:45:24,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:45:24,802 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:45:24,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 23:45:24,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:45:24,885 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:45:24,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:45:24,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-02-20 23:45:25,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-02-20 23:45:25,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {2560#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(14bv32, 2bv32); {2560#true} is VALID [2022-02-20 23:45:25,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {2560#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {2568#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:45:25,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {2568#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {2568#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:45:25,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {2568#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {2575#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:45:26,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {2575#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {2579#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:45:26,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {2579#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2579#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:45:26,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {2579#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} assume { :end_inline_alloc_data } true; {2579#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:45:26,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {2579#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L544 {2579#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:45:26,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {2579#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L544-1 {2592#(and (= (_ bv0 32) |ULTIMATE.start_main_#t~mem8#1.offset|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|)))} is VALID [2022-02-20 23:45:26,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {2592#(and (= (_ bv0 32) |ULTIMATE.start_main_#t~mem8#1.offset|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|)))} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {2596#(and (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| (_ bv0 32)) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| |ULTIMATE.start_free_data_~#data#1.base|)))} is VALID [2022-02-20 23:45:26,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {2596#(and (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| (_ bv0 32)) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| |ULTIMATE.start_free_data_~#data#1.base|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532 {2596#(and (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| (_ bv0 32)) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| |ULTIMATE.start_free_data_~#data#1.base|)))} is VALID [2022-02-20 23:45:26,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {2596#(and (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| (_ bv0 32)) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| |ULTIMATE.start_free_data_~#data#1.base|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L532-1 {2603#(and (= (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |ULTIMATE.start_free_data_~#data#1.base|)))} is VALID [2022-02-20 23:45:26,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {2603#(and (= (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |ULTIMATE.start_free_data_~#data#1.base|)))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532-2 {2603#(and (= (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |ULTIMATE.start_free_data_~#data#1.base|)))} is VALID [2022-02-20 23:45:26,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {2603#(and (= (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |ULTIMATE.start_free_data_~#data#1.base|)))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {2603#(and (= (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |ULTIMATE.start_free_data_~#data#1.base|)))} is VALID [2022-02-20 23:45:26,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {2603#(and (= (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |ULTIMATE.start_free_data_~#data#1.base|)))} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L535 {2613#(and (= (bvneg (select |#valid| |ULTIMATE.start_free_data_#t~mem6#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_free_data_#t~mem6#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:45:26,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {2613#(and (= (bvneg (select |#valid| |ULTIMATE.start_free_data_#t~mem6#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_free_data_#t~mem6#1.offset| (_ bv0 32)))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {2617#(and (= (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))) (= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:45:26,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {2617#(and (= (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))) (= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32)))} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {2621#(and (= (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))) (or (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32)))))} is VALID [2022-02-20 23:45:26,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {2621#(and (= (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))) (or (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32)))))} assume 0bv32 == free_data_~lo~0#1.offset; {2625#(and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|)))))} is VALID [2022-02-20 23:45:26,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {2625#(and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|)))))} assume ~bvult32(free_data_~lo~0#1.base, #StackHeapBarrier); {2625#(and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|)))))} is VALID [2022-02-20 23:45:26,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {2625#(and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|)))))} assume 0bv32 == free_data_~lo~0#1.base || 1bv1 == #valid[free_data_~lo~0#1.base];call ULTIMATE.dealloc(free_data_~lo~0#1.base, free_data_~lo~0#1.offset); {2632#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))))} is VALID [2022-02-20 23:45:26,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {2632#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))))} assume 0bv32 == free_data_~hi~0#1.offset; {2632#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))))} is VALID [2022-02-20 23:45:26,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {2632#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))))} assume ~bvult32(free_data_~hi~0#1.base, #StackHeapBarrier); {2632#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))))} is VALID [2022-02-20 23:45:26,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {2632#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))))} assume !(0bv32 == free_data_~hi~0#1.base || 1bv1 == #valid[free_data_~hi~0#1.base]); {2561#false} is VALID [2022-02-20 23:45:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:26,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:26,122 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:26,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565676591] [2022-02-20 23:45:26,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565676591] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:26,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:26,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 23:45:26,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238185359] [2022-02-20 23:45:26,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:26,123 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:45:26,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:26,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:26,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:26,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:45:26,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:26,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:45:26,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:45:26,382 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,692 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 23:45:27,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:45:27,692 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:45:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. [2022-02-20 23:45:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. [2022-02-20 23:45:27,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 26 transitions. [2022-02-20 23:45:28,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:28,641 INFO L225 Difference]: With dead ends: 26 [2022-02-20 23:45:28,641 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 23:45:28,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:45:28,642 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:28,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 29 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:45:28,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 23:45:28,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 23:45:28,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:28,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:28,644 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:28,644 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:28,644 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 23:45:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-02-20 23:45:28,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:28,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:28,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 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 26 states. [2022-02-20 23:45:28,644 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 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 26 states. [2022-02-20 23:45:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:28,645 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 23:45:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-02-20 23:45:28,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:28,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:28,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:28,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2022-02-20 23:45:28,646 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 23 [2022-02-20 23:45:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:28,646 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2022-02-20 23:45:28,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:28,646 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-02-20 23:45:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:45:28,646 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:28,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:28,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:28,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:45:28,847 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:45:28,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:28,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1568714712, now seen corresponding path program 1 times [2022-02-20 23:45:28,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:28,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830072325] [2022-02-20 23:45:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:28,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:28,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:28,849 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:45:28,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:45:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:29,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-20 23:45:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:29,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:29,091 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 11 treesize of output 7 [2022-02-20 23:45:29,196 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:45:29,197 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2022-02-20 23:45:29,558 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-02-20 23:45:29,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 77 [2022-02-20 23:45:30,932 INFO L356 Elim1Store]: treesize reduction 118, result has 16.9 percent of original size [2022-02-20 23:45:30,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 86 [2022-02-20 23:45:31,321 INFO L356 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2022-02-20 23:45:31,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 63 [2022-02-20 23:45:34,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {2767#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(14bv32, 2bv32); {2767#true} is VALID [2022-02-20 23:45:34,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {2775#(and (= (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (_ bv0 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)) (exists ((v_ArrVal_453 (_ BitVec 1))) (= |#valid| (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_alloc_data_#t~malloc3#1.base| v_ArrVal_453))))} is VALID [2022-02-20 23:45:34,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#(and (= (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (_ bv0 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)) (exists ((v_ArrVal_453 (_ BitVec 1))) (= |#valid| (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_alloc_data_#t~malloc3#1.base| v_ArrVal_453))))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {2779#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1))) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) v_ArrVal_453) |#valid|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {2779#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1))) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) v_ArrVal_453) |#valid|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {2783#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((v_ArrVal_453 (_ BitVec 1))) (and (= (_ bv0 1) (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) v_ArrVal_453) |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) v_ArrVal_453) |ULTIMATE.start_alloc_data_#t~malloc4#1.base| (_ bv1 1)) |#valid|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {2783#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((v_ArrVal_453 (_ BitVec 1))) (and (= (_ bv0 1) (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) v_ArrVal_453) |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) v_ArrVal_453) |ULTIMATE.start_alloc_data_#t~malloc4#1.base| (_ bv1 1)) |#valid|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {2787#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1))) (and (= (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |#valid|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {2787#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1))) (and (= (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |#valid|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2787#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1))) (and (= (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |#valid|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {2787#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1))) (and (= (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |#valid|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} assume { :end_inline_alloc_data } true; {2787#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1))) (and (= (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |#valid|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {2787#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1))) (and (= (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |#valid|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L544 {2797#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1))) (and (= (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |#valid|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {2797#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1))) (and (= (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |#valid|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L544-1 {2801#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_#t~mem8#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (= (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |#valid|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {2801#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_#t~mem8#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.base|) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (= (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |#valid|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {2805#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1)) (|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.base|) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |#valid|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_free_data_#in~data#1.hi.base|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {2805#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1)) (|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.base|) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |#valid|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_free_data_#in~data#1.hi.base|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532 {2809#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1)) (|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32))) (and (= (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) |ULTIMATE.start_free_data_#in~data#1.hi.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|) (_ bv0 1)) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_free_data_#in~data#1.hi.base|) (= (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (_ bv0 1)) (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) |ULTIMATE.start_free_data_#in~data#1.hi.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |#valid|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {2809#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1)) (|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32))) (and (= (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) |ULTIMATE.start_free_data_#in~data#1.hi.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|) (_ bv0 1)) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_free_data_#in~data#1.hi.base|) (= (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (_ bv0 1)) (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) v_ArrVal_453) |ULTIMATE.start_free_data_#in~data#1.hi.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |#valid|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L532-1 {2813#(and (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |#valid|) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv0 1)))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {2813#(and (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |#valid|) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv0 1)))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L532-2 {2817#(and (= |ULTIMATE.start_free_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |#valid|) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv0 1)))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {2817#(and (= |ULTIMATE.start_free_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |#valid|) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv0 1)))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {2821#(and (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_~lo~0#1.base|) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |#valid|) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv0 1)))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {2821#(and (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_~lo~0#1.base|) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |#valid|) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) v_ArrVal_453) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv0 1)))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L535 {2825#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_#t~mem6#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |#valid|) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_#t~mem6#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_#t~mem6#1.base|)) (_ bv0 1)))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {2825#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_#t~mem6#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |#valid|) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_#t~mem6#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_#t~mem6#1.base|)) (_ bv0 1)))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {2829#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= |#valid| (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460)) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {2829#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= |#valid| (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460)) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} assume !(free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset); {2829#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= |#valid| (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460)) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {2829#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= |#valid| (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460)) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} assume 0bv32 == free_data_~lo~0#1.offset; {2829#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= |#valid| (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460)) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {2829#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= |#valid| (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460)) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} assume ~bvult32(free_data_~lo~0#1.base, #StackHeapBarrier); {2829#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= |#valid| (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460)) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {2829#(and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1))) (and (= |#valid| (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460)) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} assume 0bv32 == free_data_~lo~0#1.base || 1bv1 == #valid[free_data_~lo~0#1.base];call ULTIMATE.dealloc(free_data_~lo~0#1.base, free_data_~lo~0#1.offset); {2842#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1)) (|ULTIMATE.start_free_data_~lo~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))) (= |#valid| (store (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |ULTIMATE.start_free_data_~lo~0#1.base| (_ bv0 1))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {2842#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1)) (|ULTIMATE.start_free_data_~lo~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))) (= |#valid| (store (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |ULTIMATE.start_free_data_~lo~0#1.base| (_ bv0 1))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} assume 0bv32 == free_data_~hi~0#1.offset; {2842#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1)) (|ULTIMATE.start_free_data_~lo~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))) (= |#valid| (store (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |ULTIMATE.start_free_data_~lo~0#1.base| (_ bv0 1))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {2842#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1)) (|ULTIMATE.start_free_data_~lo~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))) (= |#valid| (store (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |ULTIMATE.start_free_data_~lo~0#1.base| (_ bv0 1))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} assume ~bvult32(free_data_~hi~0#1.base, #StackHeapBarrier); {2842#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1)) (|ULTIMATE.start_free_data_~lo~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))) (= |#valid| (store (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |ULTIMATE.start_free_data_~lo~0#1.base| (_ bv0 1))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {2842#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (v_ArrVal_460 (_ BitVec 1)) (|ULTIMATE.start_free_data_~lo~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base|)) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))) (= |#valid| (store (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~#data#1.base| v_ArrVal_460) |ULTIMATE.start_free_data_~lo~0#1.base| (_ bv0 1))))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} assume 0bv32 == free_data_~hi~0#1.base || 1bv1 == #valid[free_data_~hi~0#1.base];call ULTIMATE.dealloc(free_data_~hi~0#1.base, free_data_~hi~0#1.offset);call ULTIMATE.dealloc(free_data_~#data#1.base, free_data_~#data#1.offset);havoc free_data_~#data#1.base, free_data_~#data#1.offset; {2852#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (|ULTIMATE.start_free_data_~hi~0#1.base| (_ BitVec 32)) (v_ArrVal_460 (_ BitVec 1)) (|v_ULTIMATE.start_free_data_~#data#1.base_19| (_ BitVec 32)) (|ULTIMATE.start_free_data_~lo~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (= (store (store (store (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |v_ULTIMATE.start_free_data_~#data#1.base_19| v_ArrVal_460) |ULTIMATE.start_free_data_~lo~0#1.base| (_ bv0 1)) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv0 1)) |v_ULTIMATE.start_free_data_~#data#1.base_19| (_ bv0 1)) |#valid|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |v_ULTIMATE.start_free_data_~#data#1.base_19|)))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:45:34,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {2852#(and (exists ((v_ArrVal_453 (_ BitVec 1)) (|ULTIMATE.start_free_data_~hi~0#1.base| (_ BitVec 32)) (v_ArrVal_460 (_ BitVec 1)) (|v_ULTIMATE.start_free_data_~#data#1.base_19| (_ BitVec 32)) (|ULTIMATE.start_free_data_~lo~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|))) (= (store (store (store (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |v_ULTIMATE.start_free_data_~#data#1.base_19| v_ArrVal_460) |ULTIMATE.start_free_data_~lo~0#1.base| (_ bv0 1)) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv0 1)) |v_ULTIMATE.start_free_data_~#data#1.base_19| (_ bv0 1)) |#valid|) (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))) (= (_ bv0 1) (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |v_ULTIMATE.start_free_data_~#data#1.base_19|)))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#data~0#1.base|)))} assume { :end_inline_free_data } true;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_#res#1 := 0bv32;call ULTIMATE.dealloc(main_~#data~0#1.base, main_~#data~0#1.offset);havoc main_~#data~0#1.base, main_~#data~0#1.offset; {2856#(exists ((v_ArrVal_453 (_ BitVec 1)) (|ULTIMATE.start_free_data_~hi~0#1.base| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#data~0#1.base_11| (_ BitVec 32)) (v_ArrVal_460 (_ BitVec 1)) (|v_ULTIMATE.start_free_data_~#data#1.base_19| (_ BitVec 32)) (|ULTIMATE.start_free_data_~lo~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~0#1.base_11| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))) (= (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~0#1.base_11| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |v_ULTIMATE.start_free_data_~#data#1.base_19|) (_ bv0 1)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~0#1.base_11|)) (= |#valid| (store (store (store (store (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~0#1.base_11| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |v_ULTIMATE.start_free_data_~#data#1.base_19| v_ArrVal_460) |ULTIMATE.start_free_data_~lo~0#1.base| (_ bv0 1)) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv0 1)) |v_ULTIMATE.start_free_data_~#data#1.base_19| (_ bv0 1)) |v_ULTIMATE.start_main_~#data~0#1.base_11| (_ bv0 1))) (= (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~0#1.base_11| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:45:34,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {2856#(exists ((v_ArrVal_453 (_ BitVec 1)) (|ULTIMATE.start_free_data_~hi~0#1.base| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#data~0#1.base_11| (_ BitVec 32)) (v_ArrVal_460 (_ BitVec 1)) (|v_ULTIMATE.start_free_data_~#data#1.base_19| (_ BitVec 32)) (|ULTIMATE.start_free_data_~lo~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select (store (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~0#1.base_11| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base|))) (= (select (store (store (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~0#1.base_11| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |v_ULTIMATE.start_free_data_~#data#1.base_19|) (_ bv0 1)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~0#1.base_11|)) (= |#valid| (store (store (store (store (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~0#1.base_11| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base| v_ArrVal_453) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv1 1)) |v_ULTIMATE.start_free_data_~#data#1.base_19| v_ArrVal_460) |ULTIMATE.start_free_data_~lo~0#1.base| (_ bv0 1)) |ULTIMATE.start_free_data_~hi~0#1.base| (_ bv0 1)) |v_ULTIMATE.start_free_data_~#data#1.base_19| (_ bv0 1)) |v_ULTIMATE.start_main_~#data~0#1.base_11| (_ bv0 1))) (= (bvneg (select (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~0#1.base_11| (_ bv1 1)) |ULTIMATE.start_free_data_~lo~0#1.base|)) (_ bv0 1))))} assume !(#valid == main_old_#valid#1); {2768#false} is VALID [2022-02-20 23:45:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:34,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:34,481 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:34,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830072325] [2022-02-20 23:45:34,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830072325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:34,482 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:34,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-20 23:45:34,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21166057] [2022-02-20 23:45:34,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:34,482 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 23:45:34,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:34,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:34,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:34,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 23:45:34,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:34,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 23:45:34,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=269, Unknown=1, NotChecked=0, Total=306 [2022-02-20 23:45:34,549 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:34,673 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2022-02-20 23:45:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:45:34,673 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 23:45:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:34,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-20 23:45:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-20 23:45:34,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 25 transitions. [2022-02-20 23:45:34,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:34,748 INFO L225 Difference]: With dead ends: 25 [2022-02-20 23:45:34,748 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 23:45:34,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=36, Invalid=269, Unknown=1, NotChecked=0, Total=306 [2022-02-20 23:45:34,749 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:34,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 44 Unchecked, 0.0s Time] [2022-02-20 23:45:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 23:45:34,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 23:45:34,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:34,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:34,749 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:34,749 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:34,749 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:45:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:45:34,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:34,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:34,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-02-20 23:45:34,750 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-02-20 23:45:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:34,750 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:45:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:45:34,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:34,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:34,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:34,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 23:45:34,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-02-20 23:45:34,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:34,751 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 23:45:34,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:45:34,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:34,753 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (22 of 23 remaining) [2022-02-20 23:45:34,753 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (21 of 23 remaining) [2022-02-20 23:45:34,753 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (20 of 23 remaining) [2022-02-20 23:45:34,753 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (19 of 23 remaining) [2022-02-20 23:45:34,753 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION (18 of 23 remaining) [2022-02-20 23:45:34,753 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (17 of 23 remaining) [2022-02-20 23:45:34,753 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATION (16 of 23 remaining) [2022-02-20 23:45:34,753 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION (15 of 23 remaining) [2022-02-20 23:45:34,753 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATION (14 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATION (13 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION (12 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATION (11 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATION (10 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATION (9 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATION (8 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATION (7 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (6 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (5 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (1 of 23 remaining) [2022-02-20 23:45:34,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2022-02-20 23:45:34,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:34,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:45:34,957 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:34,958 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:45:34,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:45:34 BoogieIcfgContainer [2022-02-20 23:45:34,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:45:34,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:45:34,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:45:34,961 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:45:34,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:39" (3/4) ... [2022-02-20 23:45:34,964 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 23:45:34,976 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 23:45:34,976 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 23:45:34,976 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-20 23:45:34,977 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 23:45:34,996 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:45:34,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:45:34,997 INFO L158 Benchmark]: Toolchain (without parser) took 56377.84ms. Allocated memory was 56.6MB in the beginning and 123.7MB in the end (delta: 67.1MB). Free memory was 33.2MB in the beginning and 101.9MB in the end (delta: -68.7MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2022-02-20 23:45:34,998 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 56.6MB. Free memory was 37.3MB in the beginning and 37.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:45:34,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.78ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 33.0MB in the beginning and 51.7MB in the end (delta: -18.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-20 23:45:34,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.28ms. Allocated memory is still 77.6MB. Free memory was 51.7MB in the beginning and 49.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:45:34,998 INFO L158 Benchmark]: Boogie Preprocessor took 39.63ms. Allocated memory is still 77.6MB. Free memory was 49.6MB in the beginning and 47.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:45:34,998 INFO L158 Benchmark]: RCFGBuilder took 425.48ms. Allocated memory is still 77.6MB. Free memory was 47.5MB in the beginning and 53.5MB in the end (delta: -6.0MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-02-20 23:45:34,998 INFO L158 Benchmark]: TraceAbstraction took 55444.78ms. Allocated memory was 77.6MB in the beginning and 123.7MB in the end (delta: 46.1MB). Free memory was 53.1MB in the beginning and 32.3MB in the end (delta: 20.8MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2022-02-20 23:45:34,999 INFO L158 Benchmark]: Witness Printer took 36.21ms. Allocated memory is still 123.7MB. Free memory was 32.3MB in the beginning and 101.9MB in the end (delta: -69.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:45:34,999 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.10ms. Allocated memory is still 56.6MB. Free memory was 37.3MB in the beginning and 37.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.78ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 33.0MB in the beginning and 51.7MB in the end (delta: -18.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.28ms. Allocated memory is still 77.6MB. Free memory was 51.7MB in the beginning and 49.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.63ms. Allocated memory is still 77.6MB. Free memory was 49.6MB in the beginning and 47.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.48ms. Allocated memory is still 77.6MB. Free memory was 47.5MB in the beginning and 53.5MB in the end (delta: -6.0MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * TraceAbstraction took 55444.78ms. Allocated memory was 77.6MB in the beginning and 123.7MB in the end (delta: 46.1MB). Free memory was 53.1MB in the beginning and 32.3MB in the end (delta: 20.8MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * Witness Printer took 36.21ms. Allocated memory is still 123.7MB. Free memory was 32.3MB in the beginning and 101.9MB in the end (delta: -69.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 55.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 479 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 479 mSDsluCounter, 824 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 314 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 807 IncrementalHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 276 mSDtfsCounter, 807 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.7s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 201 ConstructedInterpolants, 60 QuantifiedInterpolants, 3821 SizeOfPredicates, 145 NumberOfNonLiveVariables, 1590 ConjunctsInSsa, 274 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 23:45:35,078 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 Writing output log to file Ultimate.log Result: TRUE