./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/simple_built_from_end.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple_built_from_end.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 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:46:10,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:46:10,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:46:10,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:46:10,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:46:10,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:46:10,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:46:10,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:46:10,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:46:10,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:46:10,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:46:10,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:46:10,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:46:10,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:46:10,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:46:10,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:46:10,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:46:10,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:46:10,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:46:10,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:46:10,638 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:46:10,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:46:10,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:46:10,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:46:10,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:46:10,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:46:10,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:46:10,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:46:10,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:46:10,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:46:10,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:46:10,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:46:10,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:46:10,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:46:10,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:46:10,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:46:10,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:46:10,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:46:10,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:46:10,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:46:10,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:46:10,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:46:10,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:46:10,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:46:10,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:46:10,689 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:46:10,689 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:46:10,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:46:10,690 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:46:10,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:46:10,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:46:10,690 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:46:10,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:46:10,691 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:46:10,692 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:46:10,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:46:10,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:46:10,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:46:10,692 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:46:10,693 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:46:10,693 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:46:10,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:46:10,693 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:46:10,694 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:46:10,694 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:46:10,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:46:10,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:46:10,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:46:10,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:46:10,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:46:10,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:46:10,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:46:10,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:46:10,696 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 -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2022-07-14 06:46:10,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:46:10,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:46:10,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:46:10,966 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:46:10,967 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:46:10,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2022-07-14 06:46:11,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a268c3f91/a21075e2c28e4347919991bd78d4a88f/FLAG50ee9e5ff [2022-07-14 06:46:11,486 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:46:11,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2022-07-14 06:46:11,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a268c3f91/a21075e2c28e4347919991bd78d4a88f/FLAG50ee9e5ff [2022-07-14 06:46:11,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a268c3f91/a21075e2c28e4347919991bd78d4a88f [2022-07-14 06:46:11,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:46:11,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:46:11,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:46:11,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:46:11,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:46:11,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:46:11" (1/1) ... [2022-07-14 06:46:11,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266c2da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:11, skipping insertion in model container [2022-07-14 06:46:11,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:46:11" (1/1) ... [2022-07-14 06:46:11,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:46:11,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:46:12,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2022-07-14 06:46:12,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:46:12,176 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:46:12,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2022-07-14 06:46:12,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:46:12,236 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:46:12,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:12 WrapperNode [2022-07-14 06:46:12,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:46:12,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:46:12,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:46:12,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:46:12,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:12" (1/1) ... [2022-07-14 06:46:12,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:12" (1/1) ... [2022-07-14 06:46:12,274 INFO L137 Inliner]: procedures = 124, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2022-07-14 06:46:12,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:46:12,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:46:12,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:46:12,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:46:12,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:12" (1/1) ... [2022-07-14 06:46:12,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:12" (1/1) ... [2022-07-14 06:46:12,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:12" (1/1) ... [2022-07-14 06:46:12,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:12" (1/1) ... [2022-07-14 06:46:12,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:12" (1/1) ... [2022-07-14 06:46:12,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:12" (1/1) ... [2022-07-14 06:46:12,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:12" (1/1) ... [2022-07-14 06:46:12,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:46:12,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:46:12,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:46:12,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:46:12,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:12" (1/1) ... [2022-07-14 06:46:12,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:46:12,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:46:12,344 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-07-14 06:46:12,359 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-07-14 06:46:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:46:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:46:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:46:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:46:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:46:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:46:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:46:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:46:12,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:46:12,516 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:46:12,537 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:46:12,707 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:46:12,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:46:12,713 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 06:46:12,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:46:12 BoogieIcfgContainer [2022-07-14 06:46:12,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:46:12,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:46:12,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:46:12,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:46:12,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:46:11" (1/3) ... [2022-07-14 06:46:12,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e456db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:46:12, skipping insertion in model container [2022-07-14 06:46:12,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:12" (2/3) ... [2022-07-14 06:46:12,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e456db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:46:12, skipping insertion in model container [2022-07-14 06:46:12,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:46:12" (3/3) ... [2022-07-14 06:46:12,725 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2022-07-14 06:46:12,738 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:46:12,738 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-07-14 06:46:12,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:46:12,798 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@605e3e2a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@751e7e65 [2022-07-14 06:46:12,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-07-14 06:46:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 06:46:12,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:12,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 06:46:12,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash 28716783, now seen corresponding path program 1 times [2022-07-14 06:46:12,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:46:12,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295351842] [2022-07-14 06:46:12,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:46:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:12,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:46:12,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295351842] [2022-07-14 06:46:12,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295351842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:12,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:12,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:46:12,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795815207] [2022-07-14 06:46:12,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:12,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 06:46:12,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:46:12,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 06:46:12,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:46:13,000 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:13,012 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-07-14 06:46:13,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 06:46:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 06:46:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:13,021 INFO L225 Difference]: With dead ends: 28 [2022-07-14 06:46:13,021 INFO L226 Difference]: Without dead ends: 25 [2022-07-14 06:46:13,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:46:13,025 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:13,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:46:13,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-14 06:46:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-14 06:46:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-14 06:46:13,053 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 5 [2022-07-14 06:46:13,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:13,054 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-14 06:46:13,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,055 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-14 06:46:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:46:13,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:13,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:46:13,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:46:13,056 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:13,058 INFO L85 PathProgramCache]: Analyzing trace with hash 889570012, now seen corresponding path program 1 times [2022-07-14 06:46:13,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:46:13,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75975840] [2022-07-14 06:46:13,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:13,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:46:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:13,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:46:13,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75975840] [2022-07-14 06:46:13,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75975840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:13,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:13,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:46:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006800968] [2022-07-14 06:46:13,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:13,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:46:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:46:13,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:46:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:13,125 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:13,163 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-07-14 06:46:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:46:13,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 06:46:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:13,166 INFO L225 Difference]: With dead ends: 39 [2022-07-14 06:46:13,166 INFO L226 Difference]: Without dead ends: 38 [2022-07-14 06:46:13,170 INFO L412 NwaCegarLoop]: 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-07-14 06:46:13,171 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:13,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 35 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:46:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-14 06:46:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-07-14 06:46:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-07-14 06:46:13,181 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 6 [2022-07-14 06:46:13,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:13,183 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-07-14 06:46:13,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-07-14 06:46:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:46:13,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:13,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:46:13,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:46:13,188 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:13,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash 889570056, now seen corresponding path program 1 times [2022-07-14 06:46:13,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:46:13,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297483184] [2022-07-14 06:46:13,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:13,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:46:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:13,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:46:13,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297483184] [2022-07-14 06:46:13,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297483184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:13,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:13,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:46:13,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525545245] [2022-07-14 06:46:13,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:13,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:46:13,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:46:13,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:46:13,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:13,226 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:13,249 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-07-14 06:46:13,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:46:13,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 06:46:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:13,250 INFO L225 Difference]: With dead ends: 36 [2022-07-14 06:46:13,251 INFO L226 Difference]: Without dead ends: 35 [2022-07-14 06:46:13,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:13,253 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:13,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 38 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:46:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-14 06:46:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2022-07-14 06:46:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-07-14 06:46:13,262 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 6 [2022-07-14 06:46:13,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:13,262 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-07-14 06:46:13,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-07-14 06:46:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:46:13,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:13,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:46:13,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:46:13,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:13,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:13,267 INFO L85 PathProgramCache]: Analyzing trace with hash 889571371, now seen corresponding path program 1 times [2022-07-14 06:46:13,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:46:13,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275308670] [2022-07-14 06:46:13,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:46:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:13,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:46:13,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275308670] [2022-07-14 06:46:13,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275308670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:13,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:13,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:46:13,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271410174] [2022-07-14 06:46:13,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:13,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:46:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:46:13,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:46:13,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:13,320 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:13,348 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-14 06:46:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:46:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 06:46:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:13,349 INFO L225 Difference]: With dead ends: 25 [2022-07-14 06:46:13,349 INFO L226 Difference]: Without dead ends: 25 [2022-07-14 06:46:13,350 INFO L412 NwaCegarLoop]: 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-07-14 06:46:13,356 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:13,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:46:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-14 06:46:13,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-14 06:46:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-14 06:46:13,365 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 6 [2022-07-14 06:46:13,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:13,365 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-14 06:46:13,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-14 06:46:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:46:13,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:13,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:46:13,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:46:13,367 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash 889571372, now seen corresponding path program 1 times [2022-07-14 06:46:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:46:13,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957812760] [2022-07-14 06:46:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:13,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:46:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:13,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:46:13,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957812760] [2022-07-14 06:46:13,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957812760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:13,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:13,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:46:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978325655] [2022-07-14 06:46:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:13,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:46:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:46:13,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:46:13,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:13,421 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:13,438 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-07-14 06:46:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:46:13,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 06:46:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:13,439 INFO L225 Difference]: With dead ends: 23 [2022-07-14 06:46:13,439 INFO L226 Difference]: Without dead ends: 23 [2022-07-14 06:46:13,440 INFO L412 NwaCegarLoop]: 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-07-14 06:46:13,440 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:13,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 16 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:46:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-14 06:46:13,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-14 06:46:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-07-14 06:46:13,443 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 6 [2022-07-14 06:46:13,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:13,443 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-07-14 06:46:13,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-07-14 06:46:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:46:13,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:13,445 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:46:13,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:46:13,445 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:13,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1376170662, now seen corresponding path program 1 times [2022-07-14 06:46:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:46:13,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134894084] [2022-07-14 06:46:13,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:46:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:13,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:46:13,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134894084] [2022-07-14 06:46:13,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134894084] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:13,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:13,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:46:13,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587520097] [2022-07-14 06:46:13,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:13,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:46:13,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:46:13,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:46:13,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:46:13,500 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-07-14 06:46:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:13,548 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-07-14 06:46:13,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:46:13,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-07-14 06:46:13,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:13,549 INFO L225 Difference]: With dead ends: 38 [2022-07-14 06:46:13,551 INFO L226 Difference]: Without dead ends: 38 [2022-07-14 06:46:13,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:46:13,552 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:13,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 22 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:46:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-14 06:46:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2022-07-14 06:46:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-14 06:46:13,557 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2022-07-14 06:46:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:13,557 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-14 06:46:13,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-07-14 06:46:13,558 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-14 06:46:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:46:13,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:13,558 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:46:13,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:46:13,559 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:13,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1376170706, now seen corresponding path program 1 times [2022-07-14 06:46:13,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:46:13,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439438201] [2022-07-14 06:46:13,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:13,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:46:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:13,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:46:13,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439438201] [2022-07-14 06:46:13,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439438201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:13,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:13,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:46:13,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328693822] [2022-07-14 06:46:13,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:13,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:46:13,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:46:13,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:46:13,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:46:13,635 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-07-14 06:46:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:13,683 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-14 06:46:13,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:46:13,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-07-14 06:46:13,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:13,684 INFO L225 Difference]: With dead ends: 29 [2022-07-14 06:46:13,684 INFO L226 Difference]: Without dead ends: 29 [2022-07-14 06:46:13,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:46:13,685 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:13,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 13 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:46:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-14 06:46:13,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-07-14 06:46:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-07-14 06:46:13,688 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2022-07-14 06:46:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:13,689 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-07-14 06:46:13,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-07-14 06:46:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-07-14 06:46:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:46:13,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:13,690 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:46:13,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:46:13,690 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:13,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1376170707, now seen corresponding path program 1 times [2022-07-14 06:46:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:46:13,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41033033] [2022-07-14 06:46:13,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:13,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:46:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:13,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:46:13,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41033033] [2022-07-14 06:46:13,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41033033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:13,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:13,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:46:13,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361586664] [2022-07-14 06:46:13,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:13,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:46:13,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:46:13,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:46:13,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:46:13,747 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-07-14 06:46:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:13,788 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-07-14 06:46:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:46:13,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-07-14 06:46:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:13,791 INFO L225 Difference]: With dead ends: 33 [2022-07-14 06:46:13,791 INFO L226 Difference]: Without dead ends: 33 [2022-07-14 06:46:13,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:46:13,793 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:13,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 19 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:46:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-14 06:46:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-07-14 06:46:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-07-14 06:46:13,796 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2022-07-14 06:46:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:13,797 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-14 06:46:13,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-07-14 06:46:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-07-14 06:46:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:46:13,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:13,798 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:46:13,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:46:13,798 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:13,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:13,799 INFO L85 PathProgramCache]: Analyzing trace with hash -349878285, now seen corresponding path program 1 times [2022-07-14 06:46:13,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:46:13,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007921489] [2022-07-14 06:46:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:13,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:46:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:13,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:46:13,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007921489] [2022-07-14 06:46:13,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007921489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:13,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:13,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:46:13,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580529811] [2022-07-14 06:46:13,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:13,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:46:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:46:13,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:46:13,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:46:13,854 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-07-14 06:46:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:13,899 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-07-14 06:46:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:46:13,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-07-14 06:46:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:13,900 INFO L225 Difference]: With dead ends: 30 [2022-07-14 06:46:13,900 INFO L226 Difference]: Without dead ends: 30 [2022-07-14 06:46:13,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:46:13,901 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:13,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 42 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:46:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-14 06:46:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-07-14 06:46:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 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-07-14 06:46:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-07-14 06:46:13,915 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2022-07-14 06:46:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:13,915 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-14 06:46:13,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-07-14 06:46:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-07-14 06:46:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:46:13,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:13,916 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:46:13,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:46:13,916 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:13,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:13,917 INFO L85 PathProgramCache]: Analyzing trace with hash 666457592, now seen corresponding path program 1 times [2022-07-14 06:46:13,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:46:13,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232979089] [2022-07-14 06:46:13,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:46:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 06:46:13,932 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 06:46:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 06:46:13,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 06:46:13,980 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 06:46:13,981 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-07-14 06:46:13,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2022-07-14 06:46:13,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-07-14 06:46:13,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-07-14 06:46:13,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-07-14 06:46:13,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-07-14 06:46:13,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2022-07-14 06:46:13,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2022-07-14 06:46:13,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2022-07-14 06:46:13,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2022-07-14 06:46:13,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:46:13,987 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:46:13,993 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 06:46:14,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 06:46:14 BoogieIcfgContainer [2022-07-14 06:46:14,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 06:46:14,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 06:46:14,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 06:46:14,015 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 06:46:14,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:46:12" (3/4) ... [2022-07-14 06:46:14,018 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 06:46:14,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 06:46:14,019 INFO L158 Benchmark]: Toolchain (without parser) took 2179.42ms. Allocated memory was 77.6MB in the beginning and 119.5MB in the end (delta: 41.9MB). Free memory was 41.0MB in the beginning and 64.5MB in the end (delta: -23.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-07-14 06:46:14,019 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:46:14,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.57ms. Allocated memory was 77.6MB in the beginning and 119.5MB in the end (delta: 41.9MB). Free memory was 40.8MB in the beginning and 87.4MB in the end (delta: -46.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-07-14 06:46:14,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.76ms. Allocated memory is still 119.5MB. Free memory was 87.4MB in the beginning and 85.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:46:14,020 INFO L158 Benchmark]: Boogie Preprocessor took 34.29ms. Allocated memory is still 119.5MB. Free memory was 85.4MB in the beginning and 84.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:46:14,020 INFO L158 Benchmark]: RCFGBuilder took 404.13ms. Allocated memory is still 119.5MB. Free memory was 84.2MB in the beginning and 72.9MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 06:46:14,020 INFO L158 Benchmark]: TraceAbstraction took 1297.27ms. Allocated memory is still 119.5MB. Free memory was 72.4MB in the beginning and 64.5MB in the end (delta: 7.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-07-14 06:46:14,021 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 119.5MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:46:14,022 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.57ms. Allocated memory was 77.6MB in the beginning and 119.5MB in the end (delta: 41.9MB). Free memory was 40.8MB in the beginning and 87.4MB in the end (delta: -46.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.76ms. Allocated memory is still 119.5MB. Free memory was 87.4MB in the beginning and 85.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.29ms. Allocated memory is still 119.5MB. Free memory was 85.4MB in the beginning and 84.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 404.13ms. Allocated memory is still 119.5MB. Free memory was 84.2MB in the beginning and 72.9MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1297.27ms. Allocated memory is still 119.5MB. Free memory was 72.4MB in the beginning and 64.5MB in the end (delta: 7.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 119.5MB. Free memory is still 64.5MB. There was no memory consumed. 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 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List t; [L533] List p = 0; VAL [p={0:0}] [L534] COND TRUE __VERIFIER_nondet_int() [L535] t = (List) malloc(sizeof(struct node)) [L536] COND FALSE !(t == 0) VAL [p={0:0}, t={-1:0}] [L537] t->h = 1 VAL [p={0:0}, t={-1:0}] [L538] t->n = p VAL [p={0:0}, t={-1:0}] [L539] p = t VAL [p={-1:0}, t={-1:0}] [L534] COND FALSE !(__VERIFIER_nondet_int()) [L541] COND TRUE p!=0 VAL [p={-1:0}, t={-1:0}] [L542] EXPR p->h VAL [p={-1:0}, p->h=1, t={-1:0}] [L542] COND FALSE !(p->h != 1) [L545] EXPR p->n VAL [p={-1:0}, p->n={0:0}, t={-1:0}] [L545] p = p->n [L541] COND FALSE !(p!=0) VAL [p={0:0}, t={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 181 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 160 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 32, 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, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8/8 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 could not prove your program: unable to determine feasibility of some traces [2022-07-14 06:46:14,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:46:16,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:46:16,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:46:16,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:46:16,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:46:16,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:46:16,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:46:16,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:46:16,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:46:16,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:46:16,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:46:16,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:46:16,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:46:16,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:46:16,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:46:16,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:46:16,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:46:16,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:46:16,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:46:16,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:46:16,095 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:46:16,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:46:16,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:46:16,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:46:16,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:46:16,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:46:16,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:46:16,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:46:16,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:46:16,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:46:16,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:46:16,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:46:16,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:46:16,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:46:16,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:46:16,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:46:16,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:46:16,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:46:16,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:46:16,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:46:16,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:46:16,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:46:16,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 06:46:16,152 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:46:16,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:46:16,153 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:46:16,153 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:46:16,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:46:16,154 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:46:16,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:46:16,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:46:16,155 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:46:16,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:46:16,156 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:46:16,156 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:46:16,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:46:16,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:46:16,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:46:16,157 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:46:16,158 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:46:16,158 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:46:16,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:46:16,158 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:46:16,158 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:46:16,159 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:46:16,159 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:46:16,159 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:46:16,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:46:16,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:46:16,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:46:16,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:46:16,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:46:16,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:46:16,161 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:46:16,161 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:46:16,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:46:16,162 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2022-07-14 06:46:16,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:46:16,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:46:16,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:46:16,521 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:46:16,521 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:46:16,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2022-07-14 06:46:16,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9142cb7/e107843d7a7e4a3699ba1ee8e704de28/FLAGd194bc256 [2022-07-14 06:46:17,092 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:46:17,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2022-07-14 06:46:17,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9142cb7/e107843d7a7e4a3699ba1ee8e704de28/FLAGd194bc256 [2022-07-14 06:46:17,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9142cb7/e107843d7a7e4a3699ba1ee8e704de28 [2022-07-14 06:46:17,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:46:17,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:46:17,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:46:17,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:46:17,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:46:17,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:46:17" (1/1) ... [2022-07-14 06:46:17,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9443a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17, skipping insertion in model container [2022-07-14 06:46:17,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:46:17" (1/1) ... [2022-07-14 06:46:17,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:46:17,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:46:17,767 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2022-07-14 06:46:17,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:46:17,783 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:46:17,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2022-07-14 06:46:17,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:46:17,860 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:46:17,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17 WrapperNode [2022-07-14 06:46:17,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:46:17,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:46:17,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:46:17,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:46:17,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17" (1/1) ... [2022-07-14 06:46:17,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17" (1/1) ... [2022-07-14 06:46:17,922 INFO L137 Inliner]: procedures = 127, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2022-07-14 06:46:17,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:46:17,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:46:17,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:46:17,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:46:17,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17" (1/1) ... [2022-07-14 06:46:17,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17" (1/1) ... [2022-07-14 06:46:17,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17" (1/1) ... [2022-07-14 06:46:17,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17" (1/1) ... [2022-07-14 06:46:17,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17" (1/1) ... [2022-07-14 06:46:17,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17" (1/1) ... [2022-07-14 06:46:17,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17" (1/1) ... [2022-07-14 06:46:17,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:46:17,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:46:17,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:46:17,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:46:17,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17" (1/1) ... [2022-07-14 06:46:17,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:46:17,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:46:18,005 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-07-14 06:46:18,029 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-07-14 06:46:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 06:46:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:46:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:46:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:46:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:46:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 06:46:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 06:46:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:46:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:46:18,184 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:46:18,185 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:46:18,357 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:46:18,362 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:46:18,362 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 06:46:18,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:46:18 BoogieIcfgContainer [2022-07-14 06:46:18,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:46:18,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:46:18,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:46:18,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:46:18,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:46:17" (1/3) ... [2022-07-14 06:46:18,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cc7a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:46:18, skipping insertion in model container [2022-07-14 06:46:18,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:46:17" (2/3) ... [2022-07-14 06:46:18,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cc7a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:46:18, skipping insertion in model container [2022-07-14 06:46:18,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:46:18" (3/3) ... [2022-07-14 06:46:18,371 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2022-07-14 06:46:18,384 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:46:18,384 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-07-14 06:46:18,420 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:46:18,428 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d9f97ec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6df2238f [2022-07-14 06:46:18,428 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-07-14 06:46:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 2.0) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 06:46:18,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:18,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 06:46:18,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:18,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash 28698492, now seen corresponding path program 1 times [2022-07-14 06:46:18,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:46:18,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251316337] [2022-07-14 06:46:18,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:18,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:46:18,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:46:18,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:46:18,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 06:46:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:18,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 06:46:18,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:46:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:18,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:46:18,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:46:18,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251316337] [2022-07-14 06:46:18,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251316337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:18,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:18,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:46:18,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132716960] [2022-07-14 06:46:18,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:18,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:46:18,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:46:18,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:46:18,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:18,640 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 2.0) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:18,718 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-07-14 06:46:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:46:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 06:46:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:18,727 INFO L225 Difference]: With dead ends: 40 [2022-07-14 06:46:18,727 INFO L226 Difference]: Without dead ends: 36 [2022-07-14 06:46:18,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:18,732 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:18,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 38 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:46:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-14 06:46:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-07-14 06:46:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.85) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-07-14 06:46:18,766 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 5 [2022-07-14 06:46:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:18,766 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-14 06:46:18,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-07-14 06:46:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 06:46:18,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:18,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 06:46:18,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:46:18,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:46:18,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:18,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash 28698536, now seen corresponding path program 1 times [2022-07-14 06:46:18,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:46:18,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721920089] [2022-07-14 06:46:18,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:18,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:46:18,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:46:18,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:46:18,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 06:46:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:19,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:46:19,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:46:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:19,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:46:19,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:46:19,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721920089] [2022-07-14 06:46:19,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721920089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:19,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:19,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:46:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091793357] [2022-07-14 06:46:19,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:19,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:46:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:46:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:46:19,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:19,066 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:19,103 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-14 06:46:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:46:19,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 06:46:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:19,105 INFO L225 Difference]: With dead ends: 34 [2022-07-14 06:46:19,105 INFO L226 Difference]: Without dead ends: 33 [2022-07-14 06:46:19,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:19,106 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:19,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 36 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:46:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-14 06:46:19,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2022-07-14 06:46:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-14 06:46:19,110 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 5 [2022-07-14 06:46:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:19,111 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-14 06:46:19,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-14 06:46:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 06:46:19,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:19,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 06:46:19,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:46:19,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:46:19,321 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2022-07-14 06:46:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:46:19,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212113212] [2022-07-14 06:46:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:19,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:46:19,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:46:19,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:46:19,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 06:46:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:19,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:46:19,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:46:19,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:46:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:19,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:46:19,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:46:19,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212113212] [2022-07-14 06:46:19,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212113212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:19,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:19,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:46:19,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422920724] [2022-07-14 06:46:19,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:19,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:46:19,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:46:19,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:46:19,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:19,407 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:19,447 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-07-14 06:46:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:46:19,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 06:46:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:19,448 INFO L225 Difference]: With dead ends: 23 [2022-07-14 06:46:19,448 INFO L226 Difference]: Without dead ends: 23 [2022-07-14 06:46:19,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:19,450 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:19,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:46:19,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-14 06:46:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-14 06:46:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-07-14 06:46:19,453 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 5 [2022-07-14 06:46:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:19,454 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-07-14 06:46:19,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-07-14 06:46:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 06:46:19,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:19,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 06:46:19,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:46:19,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:46:19,664 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:19,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2022-07-14 06:46:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:46:19,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082867115] [2022-07-14 06:46:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:19,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:46:19,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:46:19,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:46:19,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 06:46:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:19,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:46:19,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:46:19,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:46:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:19,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:46:19,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:46:19,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082867115] [2022-07-14 06:46:19,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082867115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:19,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:19,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:46:19,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513895727] [2022-07-14 06:46:19,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:19,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:46:19,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:46:19,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:46:19,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:19,742 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:19,776 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-07-14 06:46:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:46:19,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 06:46:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:19,778 INFO L225 Difference]: With dead ends: 21 [2022-07-14 06:46:19,778 INFO L226 Difference]: Without dead ends: 21 [2022-07-14 06:46:19,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:46:19,779 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:19,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:46:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-14 06:46:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-14 06:46:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 20 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-07-14 06:46:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-14 06:46:19,783 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 5 [2022-07-14 06:46:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:19,783 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-14 06:46:19,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-14 06:46:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:46:19,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:19,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:46:19,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:46:19,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:46:19,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:19,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash -653129230, now seen corresponding path program 1 times [2022-07-14 06:46:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:46:19,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118156491] [2022-07-14 06:46:19,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:19,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:46:19,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:46:19,997 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:46:19,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 06:46:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:20,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:46:20,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:46:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:20,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:46:20,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:46:20,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118156491] [2022-07-14 06:46:20,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118156491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:20,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:20,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:46:20,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677314062] [2022-07-14 06:46:20,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:20,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:46:20,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:46:20,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:46:20,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:46:20,073 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-07-14 06:46:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:20,159 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-07-14 06:46:20,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:46:20,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-07-14 06:46:20,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:20,160 INFO L225 Difference]: With dead ends: 36 [2022-07-14 06:46:20,160 INFO L226 Difference]: Without dead ends: 36 [2022-07-14 06:46:20,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:46:20,162 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:20,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:46:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-14 06:46:20,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2022-07-14 06:46:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-07-14 06:46:20,165 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2022-07-14 06:46:20,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:20,165 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-14 06:46:20,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-07-14 06:46:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-07-14 06:46:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:46:20,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:20,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:46:20,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:46:20,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:46:20,367 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:20,368 INFO L85 PathProgramCache]: Analyzing trace with hash -653129186, now seen corresponding path program 1 times [2022-07-14 06:46:20,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:46:20,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543541128] [2022-07-14 06:46:20,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:20,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:46:20,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:46:20,370 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:46:20,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 06:46:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:20,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:46:20,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:46:20,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:46:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:20,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:46:20,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:46:20,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543541128] [2022-07-14 06:46:20,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543541128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:20,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:20,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:46:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329989390] [2022-07-14 06:46:20,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:20,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:46:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:46:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:46:20,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:46:20,461 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-07-14 06:46:20,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:20,542 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-07-14 06:46:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:46:20,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-07-14 06:46:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:20,543 INFO L225 Difference]: With dead ends: 27 [2022-07-14 06:46:20,543 INFO L226 Difference]: Without dead ends: 27 [2022-07-14 06:46:20,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:46:20,544 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 9 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:20,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 9 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:46:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-14 06:46:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-14 06:46:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:20,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-14 06:46:20,548 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2022-07-14 06:46:20,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:20,548 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-14 06:46:20,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-07-14 06:46:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-14 06:46:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:46:20,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:20,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:46:20,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:46:20,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:46:20,758 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:20,759 INFO L85 PathProgramCache]: Analyzing trace with hash -653129185, now seen corresponding path program 1 times [2022-07-14 06:46:20,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:46:20,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799306650] [2022-07-14 06:46:20,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:20,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:46:20,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:46:20,764 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:46:20,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 06:46:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:20,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:46:20,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:46:20,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:46:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:20,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:46:20,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:46:20,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799306650] [2022-07-14 06:46:20,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799306650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:20,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:20,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:46:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110387221] [2022-07-14 06:46:20,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:20,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:46:20,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:46:20,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:46:20,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:46:20,880 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-07-14 06:46:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:20,973 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-07-14 06:46:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:46:20,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-07-14 06:46:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:20,979 INFO L225 Difference]: With dead ends: 31 [2022-07-14 06:46:20,979 INFO L226 Difference]: Without dead ends: 31 [2022-07-14 06:46:20,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:46:20,980 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:20,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:46:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-14 06:46:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-07-14 06:46:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-07-14 06:46:20,984 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 10 [2022-07-14 06:46:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:20,984 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-07-14 06:46:20,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-07-14 06:46:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-07-14 06:46:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:46:20,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:20,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:46:20,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:46:21,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:46:21,195 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:21,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:21,196 INFO L85 PathProgramCache]: Analyzing trace with hash -591922145, now seen corresponding path program 1 times [2022-07-14 06:46:21,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:46:21,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243184883] [2022-07-14 06:46:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:21,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:46:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:46:21,198 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:46:21,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 06:46:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:46:21,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:46:21,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:46:21,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:46:21,330 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:46:21,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:46:21,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:46:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:46:21,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:46:21,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:46:21,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243184883] [2022-07-14 06:46:21,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243184883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:46:21,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:46:21,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:46:21,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709580608] [2022-07-14 06:46:21,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:46:21,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:46:21,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:46:21,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:46:21,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:46:21,374 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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-07-14 06:46:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:46:21,495 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-07-14 06:46:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:46:21,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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-07-14 06:46:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:46:21,496 INFO L225 Difference]: With dead ends: 28 [2022-07-14 06:46:21,496 INFO L226 Difference]: Without dead ends: 28 [2022-07-14 06:46:21,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:46:21,497 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:46:21,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:46:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-14 06:46:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-14 06:46:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:46:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-14 06:46:21,500 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2022-07-14 06:46:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:46:21,501 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-14 06:46:21,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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-07-14 06:46:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-14 06:46:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:46:21,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:46:21,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:46:21,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:46:21,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:46:21,713 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-07-14 06:46:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:46:21,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1187913323, now seen corresponding path program 1 times [2022-07-14 06:46:21,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:46:21,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560356211] [2022-07-14 06:46:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:46:21,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:46:21,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:46:21,715 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:46:21,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 06:46:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 06:46:21,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 06:46:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 06:46:21,838 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-14 06:46:21,839 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 06:46:21,840 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-07-14 06:46:21,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2022-07-14 06:46:21,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-07-14 06:46:21,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-07-14 06:46:21,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-07-14 06:46:21,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-07-14 06:46:21,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2022-07-14 06:46:21,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2022-07-14 06:46:21,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2022-07-14 06:46:21,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2022-07-14 06:46:21,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:46:22,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:46:22,047 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:46:22,049 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 06:46:22,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 06:46:22 BoogieIcfgContainer [2022-07-14 06:46:22,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 06:46:22,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 06:46:22,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 06:46:22,070 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 06:46:22,071 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:46:18" (3/4) ... [2022-07-14 06:46:22,073 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 06:46:22,073 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 06:46:22,073 INFO L158 Benchmark]: Toolchain (without parser) took 4665.56ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 41.7MB in the beginning and 37.4MB in the end (delta: 4.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-07-14 06:46:22,073 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 62.9MB. Free memory was 44.4MB in the beginning and 44.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:46:22,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.15ms. Allocated memory is still 62.9MB. Free memory was 41.5MB in the beginning and 38.2MB in the end (delta: 3.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 06:46:22,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.03ms. Allocated memory is still 62.9MB. Free memory was 38.2MB in the beginning and 36.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:46:22,074 INFO L158 Benchmark]: Boogie Preprocessor took 47.61ms. Allocated memory is still 62.9MB. Free memory was 36.3MB in the beginning and 34.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:46:22,074 INFO L158 Benchmark]: RCFGBuilder took 392.17ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 34.8MB in the beginning and 54.9MB in the end (delta: -20.0MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-07-14 06:46:22,075 INFO L158 Benchmark]: TraceAbstraction took 3703.83ms. Allocated memory is still 75.5MB. Free memory was 54.5MB in the beginning and 37.4MB in the end (delta: 17.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2022-07-14 06:46:22,075 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 75.5MB. Free memory is still 37.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:46:22,076 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 62.9MB. Free memory was 44.4MB in the beginning and 44.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.15ms. Allocated memory is still 62.9MB. Free memory was 41.5MB in the beginning and 38.2MB in the end (delta: 3.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.03ms. Allocated memory is still 62.9MB. Free memory was 38.2MB in the beginning and 36.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.61ms. Allocated memory is still 62.9MB. Free memory was 36.3MB in the beginning and 34.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 392.17ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 34.8MB in the beginning and 54.9MB in the end (delta: -20.0MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3703.83ms. Allocated memory is still 75.5MB. Free memory was 54.5MB in the beginning and 37.4MB in the end (delta: 17.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 75.5MB. Free memory is still 37.4MB. There was no memory consumed. 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 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List t; [L533] List p = 0; VAL [p={0:0}] [L534] COND TRUE __VERIFIER_nondet_int() [L535] t = (List) malloc(sizeof(struct node)) [L536] COND FALSE !(t == 0) VAL [p={0:0}, t={6:0}] [L537] t->h = 1 VAL [p={0:0}, t={6:0}] [L538] t->n = p VAL [p={0:0}, t={6:0}] [L539] p = t VAL [p={6:0}, t={6:0}] [L534] COND FALSE !(__VERIFIER_nondet_int()) [L541] COND TRUE p!=0 VAL [p={6:0}, t={6:0}] [L542] EXPR p->h VAL [p={6:0}, p->h=1, t={6:0}] [L542] COND FALSE !(p->h != 1) [L545] EXPR p->n VAL [p={6:0}, p->n={0:0}, t={6:0}] [L545] p = p->n [L541] COND FALSE !(p!=0) VAL [p={0:0}, t={6:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 119 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=1, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 9 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4/4 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 could not prove your program: unable to determine feasibility of some traces [2022-07-14 06:46:22,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample