./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/forester-heap/sll-optional-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 88a09c8f9046119952ab983278979c8bac528a0f4e69aababe99c00b4eccdca0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:09:55,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:09:55,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:09:55,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:09:55,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:09:55,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:09:55,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:09:55,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:09:55,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:09:55,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:09:55,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:09:55,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:09:55,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:09:55,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:09:55,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:09:55,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:09:55,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:09:55,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:09:55,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:09:55,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:09:55,268 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:09:55,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:09:55,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:09:55,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:09:55,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:09:55,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:09:55,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:09:55,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:09:55,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:09:55,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:09:55,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:09:55,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:09:55,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:09:55,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:09:55,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:09:55,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:09:55,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:09:55,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:09:55,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:09:55,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:09:55,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:09:55,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:09:55,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-20 05:09:55,318 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:09:55,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:09:55,322 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:09:55,322 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:09:55,323 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:09:55,323 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:09:55,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:09:55,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:09:55,324 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:09:55,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:09:55,325 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:09:55,325 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:09:55,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:09:55,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:09:55,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:09:55,326 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:09:55,326 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:09:55,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:09:55,326 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:09:55,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:09:55,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:09:55,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:09:55,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:09:55,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:09:55,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:09:55,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:09:55,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:09:55,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:09:55,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:09:55,328 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-memcleanup) ) 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 -> 88a09c8f9046119952ab983278979c8bac528a0f4e69aababe99c00b4eccdca0 [2022-07-20 05:09:55,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:09:55,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:09:55,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:09:55,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:09:55,601 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:09:55,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-2.i [2022-07-20 05:09:55,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55bdea58/20473e6a2313499ca14772c0a280e0dd/FLAG873fe79c9 [2022-07-20 05:09:56,111 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:09:56,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-2.i [2022-07-20 05:09:56,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55bdea58/20473e6a2313499ca14772c0a280e0dd/FLAG873fe79c9 [2022-07-20 05:09:56,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55bdea58/20473e6a2313499ca14772c0a280e0dd [2022-07-20 05:09:56,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:09:56,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:09:56,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:09:56,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:09:56,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:09:56,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:09:56" (1/1) ... [2022-07-20 05:09:56,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f567d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:56, skipping insertion in model container [2022-07-20 05:09:56,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:09:56" (1/1) ... [2022-07-20 05:09:56,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:09:56,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:09:56,509 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-2.i[22641,22654] [2022-07-20 05:09:56,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:09:56,529 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:09:56,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-2.i[22641,22654] [2022-07-20 05:09:56,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:09:56,594 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:09:56,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:56 WrapperNode [2022-07-20 05:09:56,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:09:56,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:09:56,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:09:56,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:09:56,603 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:09:56" (1/1) ... [2022-07-20 05:09:56,627 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:09:56" (1/1) ... [2022-07-20 05:09:56,655 INFO L137 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-07-20 05:09:56,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:09:56,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:09:56,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:09:56,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:09:56,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:56" (1/1) ... [2022-07-20 05:09:56,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:56" (1/1) ... [2022-07-20 05:09:56,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:56" (1/1) ... [2022-07-20 05:09:56,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:56" (1/1) ... [2022-07-20 05:09:56,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:56" (1/1) ... [2022-07-20 05:09:56,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:56" (1/1) ... [2022-07-20 05:09:56,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:56" (1/1) ... [2022-07-20 05:09:56,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:09:56,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:09:56,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:09:56,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:09:56,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:56" (1/1) ... [2022-07-20 05:09:56,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:09:56,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:09:56,740 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:09:56,761 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:09:56,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:09:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:09:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:09:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:09:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:09:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:09:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:09:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:09:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:09:56,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:09:56,923 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:09:56,924 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:09:57,288 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:09:57,294 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:09:57,294 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-20 05:09:57,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:09:57 BoogieIcfgContainer [2022-07-20 05:09:57,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:09:57,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:09:57,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:09:57,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:09:57,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:09:56" (1/3) ... [2022-07-20 05:09:57,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dd6b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:09:57, skipping insertion in model container [2022-07-20 05:09:57,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:56" (2/3) ... [2022-07-20 05:09:57,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dd6b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:09:57, skipping insertion in model container [2022-07-20 05:09:57,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:09:57" (3/3) ... [2022-07-20 05:09:57,303 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-2.i [2022-07-20 05:09:57,314 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:09:57,315 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-07-20 05:09:57,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:09:57,371 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@778f52cb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@709a27dd [2022-07-20 05:09:57,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-07-20 05:09:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 67 states have (on average 2.1194029850746268) internal successors, (142), 127 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:09:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:09:57,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:57,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:09:57,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-20 05:09:57,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:57,393 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 05:09:57,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:57,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619995594] [2022-07-20 05:09:57,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:57,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:57,540 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:09:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:57,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619995594] [2022-07-20 05:09:57,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619995594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:57,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:57,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:09:57,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987966841] [2022-07-20 05:09:57,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:57,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:09:57,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:09:57,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:57,576 INFO L87 Difference]: Start difference. First operand has 128 states, 67 states have (on average 2.1194029850746268) internal successors, (142), 127 states have internal predecessors, (142), 0 states have call successors, (0), 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:09:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:57,745 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2022-07-20 05:09:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:09:57,747 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:09:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:57,760 INFO L225 Difference]: With dead ends: 130 [2022-07-20 05:09:57,760 INFO L226 Difference]: Without dead ends: 126 [2022-07-20 05:09:57,762 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:09:57,765 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 111 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:57,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 73 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-20 05:09:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2022-07-20 05:09:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 69 states have (on average 1.8840579710144927) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:09:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2022-07-20 05:09:57,852 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 3 [2022-07-20 05:09:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:57,853 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2022-07-20 05:09:57,853 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:09:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2022-07-20 05:09:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:09:57,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:57,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:09:57,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:09:57,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-20 05:09:57,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:57,867 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 05:09:57,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:57,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798640328] [2022-07-20 05:09:57,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:57,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:57,922 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:09:57,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:57,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798640328] [2022-07-20 05:09:57,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798640328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:57,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:57,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:09:57,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870002787] [2022-07-20 05:09:57,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:57,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:09:57,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:57,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:09:57,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:57,928 INFO L87 Difference]: Start difference. First operand 120 states and 130 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:09:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:58,044 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2022-07-20 05:09:58,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:09:58,045 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:09:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:58,048 INFO L225 Difference]: With dead ends: 116 [2022-07-20 05:09:58,050 INFO L226 Difference]: Without dead ends: 116 [2022-07-20 05:09:58,051 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:09:58,053 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 88 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:58,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 86 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-20 05:09:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2022-07-20 05:09:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 111 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:09:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2022-07-20 05:09:58,073 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 3 [2022-07-20 05:09:58,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:58,074 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2022-07-20 05:09:58,079 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:09:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2022-07-20 05:09:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:09:58,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:58,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:58,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:09:58,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-20 05:09:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:58,089 INFO L85 PathProgramCache]: Analyzing trace with hash 171916845, now seen corresponding path program 1 times [2022-07-20 05:09:58,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:58,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522725794] [2022-07-20 05:09:58,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:58,189 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:09:58,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:58,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522725794] [2022-07-20 05:09:58,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522725794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:58,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:58,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:09:58,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699233833] [2022-07-20 05:09:58,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:58,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:09:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:58,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:09:58,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:09:58,192 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:58,351 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-07-20 05:09:58,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:09:58,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:09:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:58,356 INFO L225 Difference]: With dead ends: 141 [2022-07-20 05:09:58,356 INFO L226 Difference]: Without dead ends: 141 [2022-07-20 05:09:58,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:09:58,359 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 34 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:58,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 269 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-20 05:09:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2022-07-20 05:09:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:09:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2022-07-20 05:09:58,373 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 11 [2022-07-20 05:09:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:58,374 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2022-07-20 05:09:58,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2022-07-20 05:09:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:09:58,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:58,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:58,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:09:58,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-20 05:09:58,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:58,376 INFO L85 PathProgramCache]: Analyzing trace with hash 171916846, now seen corresponding path program 1 times [2022-07-20 05:09:58,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:58,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522003659] [2022-07-20 05:09:58,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:58,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:58,463 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:09:58,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:58,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522003659] [2022-07-20 05:09:58,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522003659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:58,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:58,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:09:58,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072425001] [2022-07-20 05:09:58,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:58,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:09:58,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:58,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:09:58,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:09:58,467 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:58,613 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-07-20 05:09:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:09:58,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:09:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:58,616 INFO L225 Difference]: With dead ends: 110 [2022-07-20 05:09:58,616 INFO L226 Difference]: Without dead ends: 110 [2022-07-20 05:09:58,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:09:58,625 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:58,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 299 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-20 05:09:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-07-20 05:09:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:09:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-07-20 05:09:58,634 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 11 [2022-07-20 05:09:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:58,634 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-07-20 05:09:58,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-07-20 05:09:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:09:58,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:58,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:58,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:09:58,636 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-20 05:09:58,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash -468215045, now seen corresponding path program 1 times [2022-07-20 05:09:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:58,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995811875] [2022-07-20 05:09:58,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:58,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:58,698 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:09:58,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:58,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995811875] [2022-07-20 05:09:58,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995811875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:58,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:58,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:09:58,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717224158] [2022-07-20 05:09:58,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:58,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:09:58,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:58,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:09:58,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:09:58,701 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:58,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:58,846 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-07-20 05:09:58,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:09:58,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 05:09:58,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:58,848 INFO L225 Difference]: With dead ends: 114 [2022-07-20 05:09:58,848 INFO L226 Difference]: Without dead ends: 114 [2022-07-20 05:09:58,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:09:58,853 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 141 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:58,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 65 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-20 05:09:58,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2022-07-20 05:09:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.6) internal successors, (120), 104 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:09:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2022-07-20 05:09:58,864 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 12 [2022-07-20 05:09:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:58,864 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2022-07-20 05:09:58,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:58,865 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2022-07-20 05:09:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:09:58,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:58,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:58,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:09:58,866 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-20 05:09:58,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash -468215044, now seen corresponding path program 1 times [2022-07-20 05:09:58,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:58,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092430354] [2022-07-20 05:09:58,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:58,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:58,971 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:09:58,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:58,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092430354] [2022-07-20 05:09:58,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092430354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:58,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:58,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:09:58,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520433510] [2022-07-20 05:09:58,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:58,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:09:58,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:58,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:09:58,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:09:58,974 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:59,175 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2022-07-20 05:09:59,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:09:59,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 05:09:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:59,177 INFO L225 Difference]: With dead ends: 147 [2022-07-20 05:09:59,177 INFO L226 Difference]: Without dead ends: 147 [2022-07-20 05:09:59,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:09:59,178 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 242 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:59,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 123 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:09:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-20 05:09:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2022-07-20 05:09:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 123 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:09:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2022-07-20 05:09:59,183 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 12 [2022-07-20 05:09:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:59,184 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2022-07-20 05:09:59,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2022-07-20 05:09:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:09:59,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:59,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:59,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:09:59,185 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-20 05:09:59,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:59,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220227, now seen corresponding path program 1 times [2022-07-20 05:09:59,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:59,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116450124] [2022-07-20 05:09:59,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:59,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:59,236 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:09:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:59,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116450124] [2022-07-20 05:09:59,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116450124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:59,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:59,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:09:59,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251844069] [2022-07-20 05:09:59,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:59,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:09:59,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:59,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:09:59,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:09:59,239 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:59,392 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2022-07-20 05:09:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:09:59,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 05:09:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:59,394 INFO L225 Difference]: With dead ends: 124 [2022-07-20 05:09:59,394 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 05:09:59,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:09:59,395 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 48 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:59,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 241 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:59,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 05:09:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-20 05:09:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 122 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:09:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2022-07-20 05:09:59,400 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 16 [2022-07-20 05:09:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:59,400 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2022-07-20 05:09:59,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2022-07-20 05:09:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:09:59,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:59,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:59,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:09:59,401 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-20 05:09:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:59,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220226, now seen corresponding path program 1 times [2022-07-20 05:09:59,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:59,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579090696] [2022-07-20 05:09:59,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:59,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:59,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:59,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579090696] [2022-07-20 05:09:59,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579090696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:59,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:59,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:09:59,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052652017] [2022-07-20 05:09:59,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:59,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:09:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:59,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:09:59,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:09:59,484 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:59,675 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2022-07-20 05:09:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:09:59,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 05:09:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:59,677 INFO L225 Difference]: With dead ends: 115 [2022-07-20 05:09:59,677 INFO L226 Difference]: Without dead ends: 115 [2022-07-20 05:09:59,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:09:59,677 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 25 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:59,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 274 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-20 05:09:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2022-07-20 05:09:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 107 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:09:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2022-07-20 05:09:59,681 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 16 [2022-07-20 05:09:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:59,681 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2022-07-20 05:09:59,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2022-07-20 05:09:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:09:59,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:59,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:59,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:09:59,683 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-20 05:09:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2122682636, now seen corresponding path program 1 times [2022-07-20 05:09:59,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:59,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268820581] [2022-07-20 05:09:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:59,713 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:09:59,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:59,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268820581] [2022-07-20 05:09:59,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268820581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:59,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:59,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:09:59,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261148624] [2022-07-20 05:09:59,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:59,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:09:59,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:59,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:09:59,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:09:59,715 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:59,792 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2022-07-20 05:09:59,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:09:59,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:09:59,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:59,793 INFO L225 Difference]: With dead ends: 130 [2022-07-20 05:09:59,794 INFO L226 Difference]: Without dead ends: 130 [2022-07-20 05:09:59,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:09:59,794 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 112 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:59,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 132 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:59,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-20 05:09:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2022-07-20 05:09:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 107 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:09:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2022-07-20 05:09:59,798 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 17 [2022-07-20 05:09:59,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:59,798 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2022-07-20 05:09:59,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2022-07-20 05:09:59,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:09:59,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:59,799 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:09:59,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 05:09:59,800 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-20 05:09:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:59,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1401407903, now seen corresponding path program 1 times [2022-07-20 05:09:59,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:59,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973140715] [2022-07-20 05:09:59,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:59,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:09:59,814 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 05:09:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:09:59,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 05:09:59,838 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 05:09:59,839 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (59 of 60 remaining) [2022-07-20 05:09:59,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 60 remaining) [2022-07-20 05:09:59,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 60 remaining) [2022-07-20 05:09:59,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 60 remaining) [2022-07-20 05:09:59,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 60 remaining) [2022-07-20 05:09:59,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 60 remaining) [2022-07-20 05:09:59,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 60 remaining) [2022-07-20 05:09:59,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 60 remaining) [2022-07-20 05:09:59,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 60 remaining) [2022-07-20 05:09:59,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 60 remaining) [2022-07-20 05:09:59,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 60 remaining) [2022-07-20 05:09:59,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 60 remaining) [2022-07-20 05:09:59,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 60 remaining) [2022-07-20 05:09:59,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 60 remaining) [2022-07-20 05:09:59,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 60 remaining) [2022-07-20 05:09:59,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 60 remaining) [2022-07-20 05:09:59,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 60 remaining) [2022-07-20 05:09:59,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 60 remaining) [2022-07-20 05:09:59,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 60 remaining) [2022-07-20 05:09:59,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 60 remaining) [2022-07-20 05:09:59,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 60 remaining) [2022-07-20 05:09:59,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 60 remaining) [2022-07-20 05:09:59,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 60 remaining) [2022-07-20 05:09:59,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 60 remaining) [2022-07-20 05:09:59,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 60 remaining) [2022-07-20 05:09:59,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 60 remaining) [2022-07-20 05:09:59,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 60 remaining) [2022-07-20 05:09:59,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 60 remaining) [2022-07-20 05:09:59,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 60 remaining) [2022-07-20 05:09:59,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 60 remaining) [2022-07-20 05:09:59,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 60 remaining) [2022-07-20 05:09:59,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 60 remaining) [2022-07-20 05:09:59,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 60 remaining) [2022-07-20 05:09:59,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 60 remaining) [2022-07-20 05:09:59,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 60 remaining) [2022-07-20 05:09:59,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 60 remaining) [2022-07-20 05:09:59,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 60 remaining) [2022-07-20 05:09:59,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 60 remaining) [2022-07-20 05:09:59,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 60 remaining) [2022-07-20 05:09:59,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 60 remaining) [2022-07-20 05:09:59,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 60 remaining) [2022-07-20 05:09:59,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 60 remaining) [2022-07-20 05:09:59,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 60 remaining) [2022-07-20 05:09:59,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 60 remaining) [2022-07-20 05:09:59,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 60 remaining) [2022-07-20 05:09:59,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 60 remaining) [2022-07-20 05:09:59,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 60 remaining) [2022-07-20 05:09:59,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 60 remaining) [2022-07-20 05:09:59,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 60 remaining) [2022-07-20 05:09:59,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 60 remaining) [2022-07-20 05:09:59,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 60 remaining) [2022-07-20 05:09:59,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 60 remaining) [2022-07-20 05:09:59,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 60 remaining) [2022-07-20 05:09:59,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (6 of 60 remaining) [2022-07-20 05:09:59,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (5 of 60 remaining) [2022-07-20 05:09:59,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE (4 of 60 remaining) [2022-07-20 05:09:59,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (3 of 60 remaining) [2022-07-20 05:09:59,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (2 of 60 remaining) [2022-07-20 05:09:59,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (1 of 60 remaining) [2022-07-20 05:09:59,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK (0 of 60 remaining) [2022-07-20 05:09:59,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 05:09:59,855 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:59,859 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 05:09:59,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:09:59 BoogieIcfgContainer [2022-07-20 05:09:59,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 05:09:59,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 05:09:59,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 05:09:59,878 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 05:09:59,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:09:57" (3/4) ... [2022-07-20 05:09:59,880 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-20 05:09:59,905 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 05:09:59,905 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 05:09:59,906 INFO L158 Benchmark]: Toolchain (without parser) took 3757.75ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 44.4MB in the beginning and 43.2MB in the end (delta: 1.2MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2022-07-20 05:09:59,906 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:09:59,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.32ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 44.2MB in the beginning and 81.6MB in the end (delta: -37.4MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2022-07-20 05:09:59,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.77ms. Allocated memory is still 113.2MB. Free memory was 81.6MB in the beginning and 79.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:09:59,907 INFO L158 Benchmark]: Boogie Preprocessor took 49.09ms. Allocated memory is still 113.2MB. Free memory was 79.5MB in the beginning and 77.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:09:59,907 INFO L158 Benchmark]: RCFGBuilder took 590.06ms. Allocated memory is still 113.2MB. Free memory was 77.6MB in the beginning and 56.9MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-20 05:09:59,907 INFO L158 Benchmark]: TraceAbstraction took 2580.50ms. Allocated memory is still 113.2MB. Free memory was 56.4MB in the beginning and 45.3MB in the end (delta: 11.1MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2022-07-20 05:09:59,908 INFO L158 Benchmark]: Witness Printer took 27.20ms. Allocated memory is still 113.2MB. Free memory was 45.3MB in the beginning and 43.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:09:59,909 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.19ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.32ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 44.2MB in the beginning and 81.6MB in the end (delta: -37.4MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.77ms. Allocated memory is still 113.2MB. Free memory was 81.6MB in the beginning and 79.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.09ms. Allocated memory is still 113.2MB. Free memory was 79.5MB in the beginning and 77.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 590.06ms. Allocated memory is still 113.2MB. Free memory was 77.6MB in the beginning and 56.9MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2580.50ms. Allocated memory is still 113.2MB. Free memory was 56.4MB in the beginning and 45.3MB in the end (delta: 11.1MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 27.20ms. Allocated memory is still 113.2MB. Free memory was 45.3MB in the beginning and 43.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1007]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = ((void*)0) VAL [head={-1:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L998] COND FALSE !(__VERIFIER_nondet_int()) [L998] head->data = 0 VAL [head={-1:0}] [L998] head->opt = head VAL [head={-1:0}] [L999] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1004] x = head VAL [head={-1:0}, x={-1:0}] [L1005] COND TRUE x != ((void*)0) VAL [head={-1:0}, x={-1:0}] [L1007] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=0] [L1007] EXPR x->data == 2 && x->opt == x VAL [head={-1:0}, x={-1:0}, x->data=0, x->data == 2 && x->opt == x=0] [L1007] COND TRUE !(x->data == 2 && x->opt == x) [L1007] reach_error() VAL [head={-1:0}, x={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 60 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 803 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 803 mSDsluCounter, 1562 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 900 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1308 IncrementalHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 662 mSDtfsCounter, 1308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 102 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-20 05:09:59,951 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)