./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0158-3.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-0158-3.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 56731b349541148adf5e7b09b4f62a37ef34decefedcd97d69429e6620dcb1d4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:44:53,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:44:53,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:44:53,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:44:53,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:44:53,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:44:53,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:44:53,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:44:53,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:44:53,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:44:53,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:44:53,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:44:53,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:44:53,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:44:53,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:44:53,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:44:53,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:44:53,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:44:53,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:44:53,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:44:53,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:44:53,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:44:53,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:44:53,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:44:53,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:44:53,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:44:53,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:44:53,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:44:53,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:44:53,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:44:53,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:44:53,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:44:53,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:44:53,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:44:53,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:44:53,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:44:53,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:44:53,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:44:53,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:44:53,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:44:53,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:44:53,553 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:53,576 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:44:53,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:44:53,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:44:53,577 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:44:53,577 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:44:53,577 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:44:53,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:44:53,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:44:53,578 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:44:53,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:44:53,579 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:44:53,579 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:44:53,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:44:53,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:44:53,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:44:53,580 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:44:53,580 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:44:53,580 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:44:53,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:44:53,580 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:44:53,580 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:44:53,580 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:44:53,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:44:53,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:44:53,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:44:53,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:53,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:44:53,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:44:53,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:44:53,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:44:53,582 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 -> 56731b349541148adf5e7b09b4f62a37ef34decefedcd97d69429e6620dcb1d4 [2022-02-20 23:44:53,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:44:53,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:44:53,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:44:53,814 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:44:53,814 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:44:53,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0158-3.i [2022-02-20 23:44:53,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2940b17cb/5818b4d2384b46e28f68007d748c720a/FLAG44a3776e6 [2022-02-20 23:44:54,281 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:44:54,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0158-3.i [2022-02-20 23:44:54,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2940b17cb/5818b4d2384b46e28f68007d748c720a/FLAG44a3776e6 [2022-02-20 23:44:54,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2940b17cb/5818b4d2384b46e28f68007d748c720a [2022-02-20 23:44:54,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:44:54,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:44:54,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:54,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:44:54,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:44:54,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:54" (1/1) ... [2022-02-20 23:44:54,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335471ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:54, skipping insertion in model container [2022-02-20 23:44:54,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:54" (1/1) ... [2022-02-20 23:44:54,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:44:54,714 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:44:54,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:54,943 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:44:54,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:55,024 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:44:55,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:55 WrapperNode [2022-02-20 23:44:55,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:55,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:55,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:44:55,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:44:55,032 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:55" (1/1) ... [2022-02-20 23:44:55,047 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:55" (1/1) ... [2022-02-20 23:44:55,066 INFO L137 Inliner]: procedures = 174, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2022-02-20 23:44:55,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:55,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:44:55,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:44:55,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:44:55,074 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:55" (1/1) ... [2022-02-20 23:44:55,074 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:55" (1/1) ... [2022-02-20 23:44:55,076 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:55" (1/1) ... [2022-02-20 23:44:55,076 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:55" (1/1) ... [2022-02-20 23:44:55,083 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:55" (1/1) ... [2022-02-20 23:44:55,084 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:55" (1/1) ... [2022-02-20 23:44:55,085 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:55" (1/1) ... [2022-02-20 23:44:55,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:44:55,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:44:55,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:44:55,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:44:55,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:55" (1/1) ... [2022-02-20 23:44:55,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:55,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:55,120 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:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:44:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:44:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:44:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:44:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:44:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:44:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:44:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:44:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:44:55,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:44:55,141 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:55,241 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:44:55,243 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:44:55,470 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:44:55,475 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:44:55,475 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:44:55,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:55 BoogieIcfgContainer [2022-02-20 23:44:55,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:44:55,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:44:55,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:44:55,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:44:55,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:44:54" (1/3) ... [2022-02-20 23:44:55,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fe0038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:55, skipping insertion in model container [2022-02-20 23:44:55,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:55" (2/3) ... [2022-02-20 23:44:55,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fe0038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:55, skipping insertion in model container [2022-02-20 23:44:55,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:55" (3/3) ... [2022-02-20 23:44:55,495 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0158-3.i [2022-02-20 23:44:55,499 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:44:55,499 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-02-20 23:44:55,547 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:44:55,552 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:55,552 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-02-20 23:44:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 17 states have (on average 2.0) internal successors, (34), 34 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:55,572 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:55,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:55,573 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:44:55,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:55,579 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:44:55,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:55,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755846301] [2022-02-20 23:44:55,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:55,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#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); {38#true} is VALID [2022-02-20 23:44:55,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {40#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} is VALID [2022-02-20 23:44:55,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} assume !(1 == #valid[main_~#data~0#1.base]); {39#false} is VALID [2022-02-20 23:44:55,766 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:55,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:55,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755846301] [2022-02-20 23:44:55,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755846301] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:55,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:55,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:55,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351567962] [2022-02-20 23:44:55,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:55,774 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:55,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:55,777 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:55,787 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:55,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:55,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:55,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:55,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:55,809 INFO L87 Difference]: Start difference. First operand has 35 states, 17 states have (on average 2.0) internal successors, (34), 34 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:55,895 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-02-20 23:44:55,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:55,895 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:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:55,896 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:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-02-20 23:44:55,905 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:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-02-20 23:44:55,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-02-20 23:44:55,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:55,942 INFO L225 Difference]: With dead ends: 30 [2022-02-20 23:44:55,943 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 23:44:55,944 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:55,946 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:55,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 22 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 23:44:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 23:44:55,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:55,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 16 states have (on average 1.6875) 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:55,980 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 16 states have (on average 1.6875) 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:55,981 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 16 states have (on average 1.6875) 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:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:55,982 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2022-02-20 23:44:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2022-02-20 23:44:55,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:55,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:55,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 16 states have (on average 1.6875) 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:55,984 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.6875) 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:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:55,985 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2022-02-20 23:44:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2022-02-20 23:44:55,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:55,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:55,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:55,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.6875) 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:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2022-02-20 23:44:55,988 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 3 [2022-02-20 23:44:55,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:55,989 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2022-02-20 23:44:55,989 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:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2022-02-20 23:44:55,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:55,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:55,989 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:55,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:44:55,990 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:44:55,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:55,990 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:44:55,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:55,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392644716] [2022-02-20 23:44:55,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:55,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:56,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#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); {157#true} is VALID [2022-02-20 23:44:56,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {159#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 10 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:56,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 10 (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); {158#false} is VALID [2022-02-20 23:44:56,048 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:56,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:56,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392644716] [2022-02-20 23:44:56,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392644716] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:56,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:56,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:56,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827560819] [2022-02-20 23:44:56,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:56,051 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:56,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:56,053 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:56,057 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:56,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:56,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:56,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:56,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:56,058 INFO L87 Difference]: Start difference. First operand 28 states and 27 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:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,098 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2022-02-20 23:44:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:56,098 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:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:56,099 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:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 23:44:56,100 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:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 23:44:56,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-02-20 23:44:56,128 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:56,129 INFO L225 Difference]: With dead ends: 23 [2022-02-20 23:44:56,129 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 23:44:56,129 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:56,131 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:56,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 17 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 23:44:56,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 23:44:56,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:56,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 22 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:56,134 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 22 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:56,135 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 22 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:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,137 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2022-02-20 23:44:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2022-02-20 23:44:56,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:56,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:56,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 22 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) Second operand 23 states. [2022-02-20 23:44:56,139 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 22 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) Second operand 23 states. [2022-02-20 23:44:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,141 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2022-02-20 23:44:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2022-02-20 23:44:56,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:56,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:56,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:56,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 22 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:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2022-02-20 23:44:56,145 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 3 [2022-02-20 23:44:56,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:56,145 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2022-02-20 23:44:56,146 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:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2022-02-20 23:44:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:44:56,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:56,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:56,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:44:56,147 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:44:56,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:56,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1056666061, now seen corresponding path program 1 times [2022-02-20 23:44:56,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:56,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986748200] [2022-02-20 23:44:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:56,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:56,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#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); {254#true} is VALID [2022-02-20 23:44:56,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {256#(= |ULTIMATE.start_main_#t~malloc3#1.offset| 0)} is VALID [2022-02-20 23:44:56,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#(= |ULTIMATE.start_main_#t~malloc3#1.offset| 0)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L650 {257#(= (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:56,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {257#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {257#(= (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:56,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {257#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} SUMMARY for call write~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L651 {257#(= (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:56,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#(= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L651-1 {257#(= (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:56,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {257#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {257#(= (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:56,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} SUMMARY for call write~int(4, main_~#data~0#1.base, 1 + main_~#data~0#1.offset, 1); srcloc: L653 {257#(= (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:56,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(= (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L653-1 {258#(= |ULTIMATE.start_main_#t~mem5#1.offset| 0)} is VALID [2022-02-20 23:44:56,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#(= |ULTIMATE.start_main_#t~mem5#1.offset| 0)} assume !(0 == main_#t~mem5#1.offset); {255#false} is VALID [2022-02-20 23:44:56,245 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:56,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:56,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986748200] [2022-02-20 23:44:56,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986748200] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:56,245 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:56,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:44:56,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410567368] [2022-02-20 23:44:56,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:56,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:44:56,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:56,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:56,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:56,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:44:56,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:56,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:44:56,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:56,256 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,333 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-02-20 23:44:56,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:44:56,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:44:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-20 23:44:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-20 23:44:56,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-02-20 23:44:56,357 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:56,359 INFO L225 Difference]: With dead ends: 22 [2022-02-20 23:44:56,359 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 23:44:56,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:44:56,364 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:56,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 37 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 23:44:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 23:44:56,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:56,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 21 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:56,368 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 21 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:56,369 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 21 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:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,374 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-02-20 23:44:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-02-20 23:44:56,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:56,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:56,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 21 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) Second operand 22 states. [2022-02-20 23:44:56,375 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 21 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) Second operand 22 states. [2022-02-20 23:44:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,379 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-02-20 23:44:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-02-20 23:44:56,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:56,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:56,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:56,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:56,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 21 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:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2022-02-20 23:44:56,383 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 10 [2022-02-20 23:44:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:56,386 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2022-02-20 23:44:56,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-02-20 23:44:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:44:56,387 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:56,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:56,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:44:56,387 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:44:56,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1603090424, now seen corresponding path program 1 times [2022-02-20 23:44:56,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:56,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794255161] [2022-02-20 23:44:56,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:56,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#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); {353#true} is VALID [2022-02-20 23:44:56,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {355#(<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:56,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#(<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L650 {356#(<= (+ (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:56,511 INFO L290 TraceCheckUtils]: 3: Hoare triple {356#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {356#(<= (+ (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:56,512 INFO L290 TraceCheckUtils]: 4: Hoare triple {356#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L651 {356#(<= (+ (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:56,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {356#(<= (+ (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L651-1 {356#(<= (+ (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:56,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {356#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {356#(<= (+ (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:56,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call write~int(4, main_~#data~0#1.base, 1 + main_~#data~0#1.offset, 1); srcloc: L653 {356#(<= (+ (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:56,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(<= (+ (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L653-1 {357#(<= (+ |ULTIMATE.start_main_#t~mem5#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:56,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(<= (+ |ULTIMATE.start_main_#t~mem5#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem5#1.offset; {357#(<= (+ |ULTIMATE.start_main_#t~mem5#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:56,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {357#(<= (+ |ULTIMATE.start_main_#t~mem5#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem5#1.base < #StackHeapBarrier); {354#false} is VALID [2022-02-20 23:44:56,517 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:56,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:56,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794255161] [2022-02-20 23:44:56,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794255161] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:56,517 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:56,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:44:56,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532493170] [2022-02-20 23:44:56,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:56,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:56,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:56,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:56,529 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:56,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:44:56,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:56,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:44:56,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:56,531 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,627 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-02-20 23:44:56,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:44:56,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-02-20 23:44:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-02-20 23:44:56,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2022-02-20 23:44:56,649 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:56,650 INFO L225 Difference]: With dead ends: 21 [2022-02-20 23:44:56,650 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 23:44:56,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:44:56,651 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:56,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 23:44:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 23:44:56,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:56,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 20 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:56,653 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 20 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:56,653 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 20 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:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,654 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-02-20 23:44:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-02-20 23:44:56,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:56,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:56,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 20 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) Second operand 21 states. [2022-02-20 23:44:56,654 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 20 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) Second operand 21 states. [2022-02-20 23:44:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,655 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-02-20 23:44:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-02-20 23:44:56,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:56,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:56,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:56,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 20 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:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2022-02-20 23:44:56,656 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 11 [2022-02-20 23:44:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:56,656 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2022-02-20 23:44:56,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-02-20 23:44:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:44:56,657 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:56,657 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:56,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:44:56,657 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:44:56,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1843804463, now seen corresponding path program 1 times [2022-02-20 23:44:56,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:56,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306200645] [2022-02-20 23:44:56,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:56,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:56,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {448#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); {448#true} is VALID [2022-02-20 23:44:56,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {448#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {450#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:44:56,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L650 {451#(= (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:56,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {451#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {451#(= (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:56,722 INFO L290 TraceCheckUtils]: 4: Hoare triple {451#(= (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 write~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L651 {451#(= (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:56,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {451#(= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L651-1 {451#(= (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:56,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {451#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {451#(= (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:56,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {451#(= (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 write~int(4, main_~#data~0#1.base, 1 + main_~#data~0#1.offset, 1); srcloc: L653 {451#(= (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:56,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#(= (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L653-1 {452#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:44:56,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} assume 0 == main_#t~mem5#1.offset; {452#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:44:56,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {452#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} assume main_#t~mem5#1.base < #StackHeapBarrier; {452#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:44:56,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {452#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} assume !(0 == main_#t~mem5#1.base || 1 == #valid[main_#t~mem5#1.base]); {449#false} is VALID [2022-02-20 23:44:56,725 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:56,725 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:56,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306200645] [2022-02-20 23:44:56,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306200645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:56,725 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:56,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:44:56,726 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347332357] [2022-02-20 23:44:56,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:56,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-02-20 23:44:56,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:56,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call 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:56,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:56,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:44:56,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:56,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:44:56,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:56,736 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call 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:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,807 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2022-02-20 23:44:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:44:56,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-02-20 23:44:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call 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:56,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-02-20 23:44:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call 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:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-02-20 23:44:56,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-02-20 23:44:56,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:56,823 INFO L225 Difference]: With dead ends: 20 [2022-02-20 23:44:56,823 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 23:44:56,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:44:56,824 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:56,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:56,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 23:44:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 23:44:56,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:56,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 19 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:56,825 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 19 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:56,826 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 19 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:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,826 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2022-02-20 23:44:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2022-02-20 23:44:56,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:56,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:56,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 19 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) Second operand 20 states. [2022-02-20 23:44:56,827 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 19 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) Second operand 20 states. [2022-02-20 23:44:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,827 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2022-02-20 23:44:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2022-02-20 23:44:56,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:56,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:56,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:56,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 19 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:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2022-02-20 23:44:56,828 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 12 [2022-02-20 23:44:56,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:56,828 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2022-02-20 23:44:56,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call 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:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2022-02-20 23:44:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:44:56,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:56,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:56,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:44:56,829 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:44:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1323363562, now seen corresponding path program 1 times [2022-02-20 23:44:56,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:56,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928849792] [2022-02-20 23:44:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:56,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {539#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); {539#true} is VALID [2022-02-20 23:44:56,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {541#(= |ULTIMATE.start_main_#t~malloc3#1.offset| 0)} is VALID [2022-02-20 23:44:56,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {541#(= |ULTIMATE.start_main_#t~malloc3#1.offset| 0)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L650 {542#(= (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:56,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {542#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {542#(= (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:56,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {542#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} SUMMARY for call write~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L651 {542#(= (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:56,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#(= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L651-1 {543#(= |ULTIMATE.start_main_#t~mem4#1.offset| 0)} is VALID [2022-02-20 23:44:56,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#(= |ULTIMATE.start_main_#t~mem4#1.offset| 0)} main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {544#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:44:56,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {544#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} SUMMARY for call write~int(4, main_~#data~0#1.base, 1 + main_~#data~0#1.offset, 1); srcloc: L653 {544#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:44:56,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L653-1 {544#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:44:56,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} assume 0 == main_#t~mem5#1.offset; {544#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:44:56,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {544#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} assume main_#t~mem5#1.base < #StackHeapBarrier; {544#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:44:56,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} assume 0 == main_#t~mem5#1.base || 1 == #valid[main_#t~mem5#1.base];call ULTIMATE.dealloc(main_#t~mem5#1.base, main_#t~mem5#1.offset);havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {544#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:44:56,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} assume !(0 == main_~ptr~0#1.offset); {540#false} is VALID [2022-02-20 23:44:56,890 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:56,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:56,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928849792] [2022-02-20 23:44:56,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928849792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:56,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:56,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:44:56,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897260553] [2022-02-20 23:44:56,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:56,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:44:56,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:56,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:56,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:56,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:44:56,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:44:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:44:56,901 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:56,993 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-02-20 23:44:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:44:56,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:44:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2022-02-20 23:44:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2022-02-20 23:44:56,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 19 transitions. [2022-02-20 23:44:57,008 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:57,009 INFO L225 Difference]: With dead ends: 19 [2022-02-20 23:44:57,009 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 23:44:57,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:44:57,011 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:57,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 31 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 23:44:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 23:44:57,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:57,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 16 states have (on average 1.125) internal successors, (18), 18 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:57,012 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 16 states have (on average 1.125) internal successors, (18), 18 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:57,012 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 16 states have (on average 1.125) internal successors, (18), 18 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:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:57,013 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-02-20 23:44:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2022-02-20 23:44:57,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:57,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:57,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 16 states have (on average 1.125) internal successors, (18), 18 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) Second operand 19 states. [2022-02-20 23:44:57,013 INFO L87 Difference]: Start difference. First operand has 19 states, 16 states have (on average 1.125) internal successors, (18), 18 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) Second operand 19 states. [2022-02-20 23:44:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:57,014 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-02-20 23:44:57,014 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2022-02-20 23:44:57,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:57,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:57,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:57,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.125) internal successors, (18), 18 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:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2022-02-20 23:44:57,015 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 13 [2022-02-20 23:44:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:57,015 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2022-02-20 23:44:57,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2022-02-20 23:44:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:44:57,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:57,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:57,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:44:57,015 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:44:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1925402479, now seen corresponding path program 1 times [2022-02-20 23:44:57,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:57,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929468711] [2022-02-20 23:44:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:57,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:57,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {629#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); {629#true} is VALID [2022-02-20 23:44:57,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {631#(<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:57,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {631#(<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L650 {632#(<= (+ (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:57,109 INFO L290 TraceCheckUtils]: 3: Hoare triple {632#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {632#(<= (+ (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:57,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {632#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L651 {632#(<= (+ (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:57,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {632#(<= (+ (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L651-1 {633#(<= (+ |ULTIMATE.start_main_#t~mem4#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:57,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {633#(<= (+ |ULTIMATE.start_main_#t~mem4#1.base| 1) |#StackHeapBarrier|)} main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:57,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~int(4, main_~#data~0#1.base, 1 + main_~#data~0#1.offset, 1); srcloc: L653 {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:57,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L653-1 {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:57,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem5#1.offset; {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:57,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} assume main_#t~mem5#1.base < #StackHeapBarrier; {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:57,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem5#1.base || 1 == #valid[main_#t~mem5#1.base];call ULTIMATE.dealloc(main_#t~mem5#1.base, main_#t~mem5#1.offset);havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:57,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~ptr~0#1.offset; {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:57,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {634#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~ptr~0#1.base < #StackHeapBarrier); {630#false} is VALID [2022-02-20 23:44:57,114 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:57,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:57,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929468711] [2022-02-20 23:44:57,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929468711] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:57,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:57,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:44:57,115 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292455891] [2022-02-20 23:44:57,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:57,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:44:57,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:57,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call 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:57,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:57,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:44:57,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:57,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:44:57,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:44:57,127 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call 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:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:57,229 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-02-20 23:44:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:44:57,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:44:57,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call 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:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2022-02-20 23:44:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call 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:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2022-02-20 23:44:57,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 18 transitions. [2022-02-20 23:44:57,247 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:57,248 INFO L225 Difference]: With dead ends: 18 [2022-02-20 23:44:57,248 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 23:44:57,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:44:57,248 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:57,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 23:44:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 23:44:57,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:57,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:57,250 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:57,250 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:57,250 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-02-20 23:44:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-02-20 23:44:57,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:57,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:57,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 23:44:57,250 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 23:44:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:57,251 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-02-20 23:44:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-02-20 23:44:57,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:57,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:57,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:57,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2022-02-20 23:44:57,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 14 [2022-02-20 23:44:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:57,252 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2022-02-20 23:44:57,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call 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:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-02-20 23:44:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:44:57,252 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:57,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:57,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:44:57,252 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:44:57,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash 442065356, now seen corresponding path program 1 times [2022-02-20 23:44:57,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:57,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645282137] [2022-02-20 23:44:57,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:57,275 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:44:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:57,310 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:44:57,311 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:44:57,311 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (16 of 17 remaining) [2022-02-20 23:44:57,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (15 of 17 remaining) [2022-02-20 23:44:57,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (14 of 17 remaining) [2022-02-20 23:44:57,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (13 of 17 remaining) [2022-02-20 23:44:57,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (12 of 17 remaining) [2022-02-20 23:44:57,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (11 of 17 remaining) [2022-02-20 23:44:57,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (10 of 17 remaining) [2022-02-20 23:44:57,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (9 of 17 remaining) [2022-02-20 23:44:57,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (8 of 17 remaining) [2022-02-20 23:44:57,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (7 of 17 remaining) [2022-02-20 23:44:57,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (6 of 17 remaining) [2022-02-20 23:44:57,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (5 of 17 remaining) [2022-02-20 23:44:57,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (4 of 17 remaining) [2022-02-20 23:44:57,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (3 of 17 remaining) [2022-02-20 23:44:57,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (2 of 17 remaining) [2022-02-20 23:44:57,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (1 of 17 remaining) [2022-02-20 23:44:57,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2022-02-20 23:44:57,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:44:57,319 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:57,322 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:44:57,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:44:57 BoogieIcfgContainer [2022-02-20 23:44:57,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:44:57,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:44:57,347 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:44:57,347 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:44:57,347 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:55" (3/4) ... [2022-02-20 23:44:57,349 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:44:57,384 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:44:57,384 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:44:57,385 INFO L158 Benchmark]: Toolchain (without parser) took 2723.74ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 73.8MB in the beginning and 72.3MB in the end (delta: 1.5MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2022-02-20 23:44:57,385 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 80.3MB in the beginning and 80.2MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:57,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.75ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 74.5MB in the end (delta: -863.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:44:57,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.18ms. Allocated memory is still 109.1MB. Free memory was 74.5MB in the beginning and 72.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:57,386 INFO L158 Benchmark]: Boogie Preprocessor took 18.60ms. Allocated memory is still 109.1MB. Free memory was 72.4MB in the beginning and 70.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:57,386 INFO L158 Benchmark]: RCFGBuilder took 390.51ms. Allocated memory is still 109.1MB. Free memory was 70.8MB in the beginning and 56.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 23:44:57,386 INFO L158 Benchmark]: TraceAbstraction took 1868.55ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 56.1MB in the beginning and 75.5MB in the end (delta: -19.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-02-20 23:44:57,386 INFO L158 Benchmark]: Witness Printer took 37.04ms. Allocated memory is still 132.1MB. Free memory was 75.5MB in the beginning and 72.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:57,387 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 80.3MB in the beginning and 80.2MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.75ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 74.5MB in the end (delta: -863.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.18ms. Allocated memory is still 109.1MB. Free memory was 74.5MB in the beginning and 72.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.60ms. Allocated memory is still 109.1MB. Free memory was 72.4MB in the beginning and 70.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.51ms. Allocated memory is still 109.1MB. Free memory was 70.8MB in the beginning and 56.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1868.55ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 56.1MB in the beginning and 75.5MB in the end (delta: -19.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Witness Printer took 37.04ms. Allocated memory is still 132.1MB. Free memory was 75.5MB in the beginning and 72.3MB in the end (delta: 3.1MB). 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 - CounterExampleResult [Line: 655]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L642-L649] union { void *p0; struct { char c[2]; void *p1; void *p2; } str; } data; [L650] data.p0 = malloc(37U) VAL [data={8:0}, malloc(37U)={5:0}] [L651] data.str.p2 = &data VAL [data={8:0}] [L652] EXPR data.p0 VAL [data={8:0}, data.p0={5:0}] [L652] void *ptr = data.p0; [L653] data.str.c[1] = sizeof data.str.p1 VAL [data={8:0}, ptr={5:0}] [L654] EXPR data.p0 VAL [data={8:0}, data.p0={5:0}, ptr={5:0}] [L654] free(data.p0) VAL [data={8:0}, data.p0={5:0}, ptr={5:0}] [L654] free(data.p0) VAL [data={8:0}, data.p0={5:0}, ptr={5:0}] [L654] free(data.p0) [L655] free(ptr) VAL [data={8:0}, ptr={5:0}] [L655] free(ptr) VAL [data={8:0}, ptr={5:0}] [L655] free(ptr) VAL [data={8:0}, ptr={5:0}] - UnprovableResult [Line: 650]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 650]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 653]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 653]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 654]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 654]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 654]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 654]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 654]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 640]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 85 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 40, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 RESULT: Ultimate proved your program to be incorrect! [2022-02-20 23:44:57,418 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)