./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0019-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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/memsafety/test-0019-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:35:53,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:35:53,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:35:53,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:35:53,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:35:53,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:35:53,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:35:53,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:35:53,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:35:53,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:35:53,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:35:53,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:35:53,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:35:53,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:35:53,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:35:53,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:35:53,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:35:53,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:35:53,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:35:53,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:35:53,406 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:35:53,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:35:53,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:35:53,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:35:53,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:35:53,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:35:53,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:35:53,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:35:53,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:35:53,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:35:53,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:35:53,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:35:53,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:35:53,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:35:53,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:35:53,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:35:53,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:35:53,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:35:53,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:35:53,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:35:53,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:35:53,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:35:53,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:35:53,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:35:53,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:35:53,442 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:35:53,442 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:35:53,443 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:35:53,444 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:35:53,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:35:53,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:35:53,445 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:35:53,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:35:53,445 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:35:53,445 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:35:53,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:35:53,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:35:53,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:35:53,446 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:35:53,446 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:35:53,447 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:35:53,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:35:53,447 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:35:53,447 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:35:53,447 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:35:53,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:35:53,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:35:53,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:35:53,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:35:53,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:35:53,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:35:53,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:35:53,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:35:53,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd [2022-07-20 05:35:53,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:35:53,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:35:53,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:35:53,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:35:53,709 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:35:53,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-1.i [2022-07-20 05:35:53,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1735299/576589a79a8a4322bad6ddf3872608f3/FLAGfd21c340f [2022-07-20 05:35:54,269 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:35:54,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-1.i [2022-07-20 05:35:54,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1735299/576589a79a8a4322bad6ddf3872608f3/FLAGfd21c340f [2022-07-20 05:35:54,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1735299/576589a79a8a4322bad6ddf3872608f3 [2022-07-20 05:35:54,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:35:54,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:35:54,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:35:54,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:35:54,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:35:54,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:35:54" (1/1) ... [2022-07-20 05:35:54,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9691cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:54, skipping insertion in model container [2022-07-20 05:35:54,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:35:54" (1/1) ... [2022-07-20 05:35:54,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:35:54,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:35:55,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:35:55,124 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:35:55,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:35:55,199 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:35:55,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:55 WrapperNode [2022-07-20 05:35:55,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:35:55,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:35:55,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:35:55,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:35:55,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:55" (1/1) ... [2022-07-20 05:35:55,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:55" (1/1) ... [2022-07-20 05:35:55,262 INFO L137 Inliner]: procedures = 125, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2022-07-20 05:35:55,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:35:55,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:35:55,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:35:55,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:35:55,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:55" (1/1) ... [2022-07-20 05:35:55,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:55" (1/1) ... [2022-07-20 05:35:55,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:55" (1/1) ... [2022-07-20 05:35:55,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:55" (1/1) ... [2022-07-20 05:35:55,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:55" (1/1) ... [2022-07-20 05:35:55,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:55" (1/1) ... [2022-07-20 05:35:55,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:55" (1/1) ... [2022-07-20 05:35:55,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:35:55,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:35:55,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:35:55,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:35:55,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:55" (1/1) ... [2022-07-20 05:35:55,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:35:55,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:55,325 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-20 05:35:55,327 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-20 05:35:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:35:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:35:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 05:35:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:35:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:35:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:35:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:35:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:35:55,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:35:55,449 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:35:55,450 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:35:55,645 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:35:55,651 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:35:55,651 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 05:35:55,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:35:55 BoogieIcfgContainer [2022-07-20 05:35:55,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:35:55,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:35:55,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:35:55,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:35:55,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:35:54" (1/3) ... [2022-07-20 05:35:55,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2d2fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:35:55, skipping insertion in model container [2022-07-20 05:35:55,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:55" (2/3) ... [2022-07-20 05:35:55,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2d2fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:35:55, skipping insertion in model container [2022-07-20 05:35:55,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:35:55" (3/3) ... [2022-07-20 05:35:55,661 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-1.i [2022-07-20 05:35:55,703 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:35:55,704 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-07-20 05:35:55,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:35:55,776 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@589c98ca, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e78ba0a [2022-07-20 05:35:55,777 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-07-20 05:35:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:35:55,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:55,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:35:55,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:55,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:55,809 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 05:35:55,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:55,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125840816] [2022-07-20 05:35:55,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:55,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:55,980 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-20 05:35:55,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:55,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125840816] [2022-07-20 05:35:55,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125840816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:55,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:55,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:35:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184502592] [2022-07-20 05:35:55,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:55,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:35:55,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:56,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:35:56,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:35:56,022 INFO L87 Difference]: Start difference. First operand has 50 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:56,113 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-07-20 05:35:56,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:35:56,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 05:35:56,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:56,124 INFO L225 Difference]: With dead ends: 48 [2022-07-20 05:35:56,124 INFO L226 Difference]: Without dead ends: 46 [2022-07-20 05:35:56,126 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-20 05:35:56,130 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:56,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 32 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-20 05:35:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-20 05:35:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-07-20 05:35:56,163 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 3 [2022-07-20 05:35:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:56,165 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-07-20 05:35:56,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-07-20 05:35:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:35:56,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:56,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:35:56,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:35:56,167 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:56,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 05:35:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:56,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878248049] [2022-07-20 05:35:56,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:56,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:56,222 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-20 05:35:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:56,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878248049] [2022-07-20 05:35:56,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878248049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:56,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:56,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:35:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518363264] [2022-07-20 05:35:56,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:56,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:35:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:56,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:35:56,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:35:56,226 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:56,253 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-07-20 05:35:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:35:56,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 05:35:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:56,255 INFO L225 Difference]: With dead ends: 45 [2022-07-20 05:35:56,255 INFO L226 Difference]: Without dead ends: 45 [2022-07-20 05:35:56,256 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-20 05:35:56,257 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:56,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-20 05:35:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-07-20 05:35:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-07-20 05:35:56,262 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 3 [2022-07-20 05:35:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:56,262 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-07-20 05:35:56,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-07-20 05:35:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 05:35:56,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:56,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 05:35:56,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:35:56,264 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:56,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:56,265 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-07-20 05:35:56,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:56,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444634438] [2022-07-20 05:35:56,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:56,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:56,386 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-20 05:35:56,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:56,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444634438] [2022-07-20 05:35:56,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444634438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:56,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:56,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:35:56,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867643443] [2022-07-20 05:35:56,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:56,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:35:56,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:56,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:35:56,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:35:56,390 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:56,438 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-07-20 05:35:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:35:56,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 05:35:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:56,439 INFO L225 Difference]: With dead ends: 44 [2022-07-20 05:35:56,440 INFO L226 Difference]: Without dead ends: 44 [2022-07-20 05:35:56,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:35:56,441 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 67 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:56,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 23 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-20 05:35:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-20 05:35:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-07-20 05:35:56,446 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 5 [2022-07-20 05:35:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:56,447 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-07-20 05:35:56,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-07-20 05:35:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:35:56,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:56,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:56,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:35:56,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:56,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:56,449 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2022-07-20 05:35:56,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:56,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941645352] [2022-07-20 05:35:56,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:56,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:56,503 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-20 05:35:56,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:56,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941645352] [2022-07-20 05:35:56,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941645352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:56,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:56,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:35:56,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025831099] [2022-07-20 05:35:56,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:56,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:35:56,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:56,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:35:56,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:35:56,506 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:56,551 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-07-20 05:35:56,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:35:56,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 05:35:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:56,553 INFO L225 Difference]: With dead ends: 42 [2022-07-20 05:35:56,553 INFO L226 Difference]: Without dead ends: 42 [2022-07-20 05:35:56,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:35:56,555 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:56,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 28 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:56,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-20 05:35:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-20 05:35:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-07-20 05:35:56,565 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 8 [2022-07-20 05:35:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:56,565 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-07-20 05:35:56,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-07-20 05:35:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:35:56,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:56,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:56,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:35:56,567 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:56,568 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2022-07-20 05:35:56,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:56,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905053581] [2022-07-20 05:35:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:56,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:56,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:56,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905053581] [2022-07-20 05:35:56,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905053581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:56,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:56,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:35:56,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205766512] [2022-07-20 05:35:56,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:56,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:35:56,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:56,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:35:56,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:35:56,647 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:56,681 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-07-20 05:35:56,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:35:56,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 05:35:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:56,682 INFO L225 Difference]: With dead ends: 40 [2022-07-20 05:35:56,682 INFO L226 Difference]: Without dead ends: 40 [2022-07-20 05:35:56,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:35:56,684 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 65 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:56,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-20 05:35:56,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-20 05:35:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-07-20 05:35:56,689 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 8 [2022-07-20 05:35:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:56,690 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-07-20 05:35:56,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-07-20 05:35:56,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:35:56,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:56,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:56,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:35:56,695 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:56,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1604044760, now seen corresponding path program 1 times [2022-07-20 05:35:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:56,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034156121] [2022-07-20 05:35:56,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:56,764 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-20 05:35:56,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:56,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034156121] [2022-07-20 05:35:56,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034156121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:56,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:56,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:35:56,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726059408] [2022-07-20 05:35:56,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:56,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:35:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:56,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:35:56,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:35:56,766 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:56,802 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-07-20 05:35:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:35:56,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:35:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:56,804 INFO L225 Difference]: With dead ends: 36 [2022-07-20 05:35:56,804 INFO L226 Difference]: Without dead ends: 36 [2022-07-20 05:35:56,804 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-20 05:35:56,806 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:56,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 31 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-20 05:35:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-20 05:35:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-07-20 05:35:56,815 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 11 [2022-07-20 05:35:56,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:56,815 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-07-20 05:35:56,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-07-20 05:35:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:35:56,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:56,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:56,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:35:56,817 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:56,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:56,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1604044759, now seen corresponding path program 1 times [2022-07-20 05:35:56,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:56,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096075199] [2022-07-20 05:35:56,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:56,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:56,899 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-20 05:35:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:56,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096075199] [2022-07-20 05:35:56,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096075199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:56,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:56,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:35:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139801880] [2022-07-20 05:35:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:56,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:35:56,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:56,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:35:56,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:35:56,902 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:56,930 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-07-20 05:35:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:35:56,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:35:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:56,933 INFO L225 Difference]: With dead ends: 32 [2022-07-20 05:35:56,934 INFO L226 Difference]: Without dead ends: 32 [2022-07-20 05:35:56,934 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-20 05:35:56,935 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:56,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-20 05:35:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-20 05:35:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-07-20 05:35:56,942 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 11 [2022-07-20 05:35:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:56,943 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-07-20 05:35:56,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-07-20 05:35:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:35:56,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:56,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:56,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:35:56,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:56,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash -353452457, now seen corresponding path program 1 times [2022-07-20 05:35:56,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:56,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838140100] [2022-07-20 05:35:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:57,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838140100] [2022-07-20 05:35:57,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838140100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:57,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:57,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:35:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861612165] [2022-07-20 05:35:57,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:57,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:35:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:57,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:35:57,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:35:57,077 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:57,238 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-07-20 05:35:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:35:57,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 05:35:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:57,239 INFO L225 Difference]: With dead ends: 31 [2022-07-20 05:35:57,239 INFO L226 Difference]: Without dead ends: 31 [2022-07-20 05:35:57,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:35:57,241 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:57,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 94 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-20 05:35:57,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-20 05:35:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-07-20 05:35:57,245 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 18 [2022-07-20 05:35:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:57,246 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-07-20 05:35:57,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-07-20 05:35:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:35:57,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:57,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:57,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:35:57,252 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:57,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1927874256, now seen corresponding path program 1 times [2022-07-20 05:35:57,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:57,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321726147] [2022-07-20 05:35:57,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:57,496 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-20 05:35:57,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:57,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321726147] [2022-07-20 05:35:57,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321726147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:57,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:57,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-20 05:35:57,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599838875] [2022-07-20 05:35:57,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:57,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 05:35:57,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:57,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 05:35:57,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:35:57,499 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:57,868 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2022-07-20 05:35:57,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:35:57,868 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 05:35:57,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:57,869 INFO L225 Difference]: With dead ends: 31 [2022-07-20 05:35:57,869 INFO L226 Difference]: Without dead ends: 31 [2022-07-20 05:35:57,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2022-07-20 05:35:57,870 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 87 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:57,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 83 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-20 05:35:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-20 05:35:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2022-07-20 05:35:57,872 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 19 [2022-07-20 05:35:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:57,873 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2022-07-20 05:35:57,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2022-07-20 05:35:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:35:57,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:57,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:57,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 05:35:57,874 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:57,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1927875793, now seen corresponding path program 1 times [2022-07-20 05:35:57,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:57,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338921042] [2022-07-20 05:35:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:57,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:58,019 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-20 05:35:58,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:58,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338921042] [2022-07-20 05:35:58,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338921042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:58,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:58,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:35:58,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466072809] [2022-07-20 05:35:58,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:58,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:35:58,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:58,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:35:58,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:35:58,021 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:58,194 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-07-20 05:35:58,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:35:58,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 05:35:58,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:58,195 INFO L225 Difference]: With dead ends: 30 [2022-07-20 05:35:58,195 INFO L226 Difference]: Without dead ends: 30 [2022-07-20 05:35:58,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:35:58,196 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:58,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 51 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-20 05:35:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-20 05:35:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 29 transitions. [2022-07-20 05:35:58,198 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 29 transitions. Word has length 19 [2022-07-20 05:35:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:58,198 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 29 transitions. [2022-07-20 05:35:58,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2022-07-20 05:35:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:35:58,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:58,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:58,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 05:35:58,199 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:58,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:58,199 INFO L85 PathProgramCache]: Analyzing trace with hash -365392487, now seen corresponding path program 1 times [2022-07-20 05:35:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:58,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088427357] [2022-07-20 05:35:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:58,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:58,363 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-20 05:35:58,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:58,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088427357] [2022-07-20 05:35:58,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088427357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:58,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:58,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:35:58,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885182715] [2022-07-20 05:35:58,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:58,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:35:58,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:58,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:35:58,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:35:58,366 INFO L87 Difference]: Start difference. First operand 30 states and 29 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:58,519 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-07-20 05:35:58,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:35:58,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 05:35:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:58,520 INFO L225 Difference]: With dead ends: 29 [2022-07-20 05:35:58,520 INFO L226 Difference]: Without dead ends: 29 [2022-07-20 05:35:58,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:35:58,520 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:58,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 66 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-20 05:35:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-20 05:35:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2022-07-20 05:35:58,523 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 20 [2022-07-20 05:35:58,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:58,523 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2022-07-20 05:35:58,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2022-07-20 05:35:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:35:58,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:58,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:58,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 05:35:58,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:58,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:58,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1557734867, now seen corresponding path program 1 times [2022-07-20 05:35:58,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:58,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429915141] [2022-07-20 05:35:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:58,645 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-20 05:35:58,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:58,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429915141] [2022-07-20 05:35:58,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429915141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:58,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:58,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:35:58,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663222796] [2022-07-20 05:35:58,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:58,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:35:58,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:58,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:35:58,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:35:58,648 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:58,805 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2022-07-20 05:35:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:35:58,805 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 05:35:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:58,806 INFO L225 Difference]: With dead ends: 28 [2022-07-20 05:35:58,806 INFO L226 Difference]: Without dead ends: 28 [2022-07-20 05:35:58,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-07-20 05:35:58,807 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:58,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 70 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-20 05:35:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-20 05:35:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2022-07-20 05:35:58,810 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 21 [2022-07-20 05:35:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:58,810 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2022-07-20 05:35:58,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2022-07-20 05:35:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 05:35:58,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:58,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:58,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 05:35:58,811 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:58,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:58,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1045140699, now seen corresponding path program 1 times [2022-07-20 05:35:58,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:58,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796851091] [2022-07-20 05:35:58,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:58,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:58,962 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-20 05:35:58,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:58,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796851091] [2022-07-20 05:35:58,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796851091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:58,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:58,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:35:58,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364244544] [2022-07-20 05:35:58,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:58,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:35:58,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:58,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:35:58,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:35:58,965 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:59,155 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2022-07-20 05:35:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:35:59,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 05:35:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:59,156 INFO L225 Difference]: With dead ends: 27 [2022-07-20 05:35:59,156 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 05:35:59,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-07-20 05:35:59,157 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:59,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 41 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 05:35:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-20 05:35:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2022-07-20 05:35:59,159 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2022-07-20 05:35:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:59,159 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2022-07-20 05:35:59,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2022-07-20 05:35:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 05:35:59,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:59,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:59,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 05:35:59,160 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:59,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1960376619, now seen corresponding path program 1 times [2022-07-20 05:35:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:59,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951582973] [2022-07-20 05:35:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:59,461 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-20 05:35:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:59,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951582973] [2022-07-20 05:35:59,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951582973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:59,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:59,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-20 05:35:59,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126260791] [2022-07-20 05:35:59,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:59,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 05:35:59,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:59,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 05:35:59,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:35:59,462 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:59,863 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-07-20 05:35:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:35:59,863 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 05:35:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:59,864 INFO L225 Difference]: With dead ends: 26 [2022-07-20 05:35:59,864 INFO L226 Difference]: Without dead ends: 26 [2022-07-20 05:35:59,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2022-07-20 05:35:59,865 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:59,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 48 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-20 05:35:59,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-20 05:35:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2022-07-20 05:35:59,867 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 23 [2022-07-20 05:35:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:59,867 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2022-07-20 05:35:59,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-07-20 05:35:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 05:35:59,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:59,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:59,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 05:35:59,869 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:35:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1568714712, now seen corresponding path program 1 times [2022-07-20 05:35:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:59,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504649686] [2022-07-20 05:35:59,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:59,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:01,108 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-20 05:36:01,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:01,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504649686] [2022-07-20 05:36:01,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504649686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:01,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:01,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-20 05:36:01,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034638701] [2022-07-20 05:36:01,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:01,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 05:36:01,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 05:36:01,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2022-07-20 05:36:01,110 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 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-20 05:36:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:02,755 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2022-07-20 05:36:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:36:02,755 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 05:36:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:02,755 INFO L225 Difference]: With dead ends: 25 [2022-07-20 05:36:02,756 INFO L226 Difference]: Without dead ends: 0 [2022-07-20 05:36:02,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2022-07-20 05:36:02,757 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:02,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 35 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:36:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-20 05:36:02,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-20 05:36:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-20 05:36:02,758 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-07-20 05:36:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:02,758 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-20 05:36:02,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 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-20 05:36:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-20 05:36:02,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-20 05:36:02,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2022-07-20 05:36:02,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2022-07-20 05:36:02,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2022-07-20 05:36:02,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2022-07-20 05:36:02,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2022-07-20 05:36:02,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2022-07-20 05:36:02,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2022-07-20 05:36:02,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2022-07-20 05:36:02,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2022-07-20 05:36:02,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2022-07-20 05:36:02,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2022-07-20 05:36:02,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2022-07-20 05:36:02,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2022-07-20 05:36:02,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2022-07-20 05:36:02,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2022-07-20 05:36:02,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2022-07-20 05:36:02,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (6 of 23 remaining) [2022-07-20 05:36:02,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (5 of 23 remaining) [2022-07-20 05:36:02,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2022-07-20 05:36:02,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2022-07-20 05:36:02,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2022-07-20 05:36:02,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (1 of 23 remaining) [2022-07-20 05:36:02,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2022-07-20 05:36:02,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 05:36:02,766 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:02,768 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 05:36:02,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:36:02 BoogieIcfgContainer [2022-07-20 05:36:02,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 05:36:02,770 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 05:36:02,770 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 05:36:02,771 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 05:36:02,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:35:55" (3/4) ... [2022-07-20 05:36:02,773 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-20 05:36:02,781 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-07-20 05:36:02,782 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-20 05:36:02,782 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-20 05:36:02,782 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-20 05:36:02,811 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 05:36:02,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 05:36:02,814 INFO L158 Benchmark]: Toolchain (without parser) took 8031.18ms. Allocated memory was 96.5MB in the beginning and 146.8MB in the end (delta: 50.3MB). Free memory was 66.1MB in the beginning and 56.5MB in the end (delta: 9.6MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2022-07-20 05:36:02,814 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 52.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:02,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.49ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 64.8MB in the end (delta: 1.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 05:36:02,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.24ms. Allocated memory is still 96.5MB. Free memory was 64.8MB in the beginning and 62.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:36:02,816 INFO L158 Benchmark]: Boogie Preprocessor took 33.35ms. Allocated memory is still 96.5MB. Free memory was 62.7MB in the beginning and 61.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:02,816 INFO L158 Benchmark]: RCFGBuilder took 354.50ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 48.0MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-20 05:36:02,816 INFO L158 Benchmark]: TraceAbstraction took 7115.91ms. Allocated memory was 96.5MB in the beginning and 146.8MB in the end (delta: 50.3MB). Free memory was 47.4MB in the beginning and 59.6MB in the end (delta: -12.2MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2022-07-20 05:36:02,817 INFO L158 Benchmark]: Witness Printer took 43.29ms. Allocated memory is still 146.8MB. Free memory was 59.6MB in the beginning and 56.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:36:02,818 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.20ms. Allocated memory is still 96.5MB. Free memory is still 52.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.49ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 64.8MB in the end (delta: 1.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.24ms. Allocated memory is still 96.5MB. Free memory was 64.8MB in the beginning and 62.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.35ms. Allocated memory is still 96.5MB. Free memory was 62.7MB in the beginning and 61.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 354.50ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 48.0MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7115.91ms. Allocated memory was 96.5MB in the beginning and 146.8MB in the end (delta: 50.3MB). Free memory was 47.4MB in the beginning and 59.6MB in the end (delta: -12.2MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * Witness Printer took 43.29ms. Allocated memory is still 146.8MB. Free memory was 59.6MB in the beginning and 56.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 687 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 687 mSDsluCounter, 730 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 457 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1453 IncrementalHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 273 mSDtfsCounter, 1453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 2503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-20 05:36:02,847 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 Writing output log to file Ultimate.log Result: TRUE