./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-1.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/dll-circular-1.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 4b74df92940ca0e86c8c02c3eca1e89fb6c9c9c1248a25cd764acf39f7727180 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:09:46,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:09:46,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:09:46,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:09:46,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:09:46,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:09:46,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:09:46,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:09:46,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:09:46,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:09:46,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:09:46,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:09:46,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:09:46,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:09:46,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:09:46,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:09:46,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:09:46,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:09:46,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:09:46,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:09:46,974 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:09:46,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:09:46,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:09:46,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:09:46,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:09:46,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:09:46,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:09:46,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:09:46,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:09:46,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:09:46,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:09:46,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:09:46,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:09:46,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:09:46,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:09:46,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:09:46,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:09:46,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:09:46,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:09:46,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:09:46,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:09:46,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:09:46,990 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:47,008 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:09:47,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:09:47,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:09:47,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:09:47,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:09:47,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:09:47,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:09:47,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:09:47,011 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:09:47,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:09:47,012 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:09:47,012 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:09:47,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:09:47,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:09:47,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:09:47,013 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:09:47,013 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:09:47,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:09:47,013 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:09:47,013 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:09:47,013 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:09:47,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:09:47,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:09:47,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:09:47,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:09:47,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:09:47,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:09:47,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:09:47,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:09:47,015 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 -> 4b74df92940ca0e86c8c02c3eca1e89fb6c9c9c1248a25cd764acf39f7727180 [2022-07-20 05:09:47,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:09:47,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:09:47,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:09:47,242 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:09:47,243 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:09:47,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-1.i [2022-07-20 05:09:47,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4211dfe9/b2f3d588311a459aab446dabbfbacece/FLAGf971ddd18 [2022-07-20 05:09:47,658 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:09:47,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i [2022-07-20 05:09:47,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4211dfe9/b2f3d588311a459aab446dabbfbacece/FLAGf971ddd18 [2022-07-20 05:09:48,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4211dfe9/b2f3d588311a459aab446dabbfbacece [2022-07-20 05:09:48,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:09:48,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:09:48,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:09:48,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:09:48,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:09:48,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c211d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48, skipping insertion in model container [2022-07-20 05:09:48,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:09:48,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:09:48,285 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/dll-circular-1.i[22365,22378] [2022-07-20 05:09:48,289 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/dll-circular-1.i[22471,22484] [2022-07-20 05:09:48,296 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/dll-circular-1.i[22595,22608] [2022-07-20 05:09:48,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:09:48,309 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:09:48,336 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/dll-circular-1.i[22365,22378] [2022-07-20 05:09:48,337 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/dll-circular-1.i[22471,22484] [2022-07-20 05:09:48,338 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/dll-circular-1.i[22595,22608] [2022-07-20 05:09:48,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:09:48,357 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:09:48,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48 WrapperNode [2022-07-20 05:09:48,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:09:48,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:09:48,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:09:48,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:09:48,364 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:48" (1/1) ... [2022-07-20 05:09:48,372 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:48" (1/1) ... [2022-07-20 05:09:48,387 INFO L137 Inliner]: procedures = 119, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2022-07-20 05:09:48,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:09:48,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:09:48,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:09:48,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:09:48,393 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:48" (1/1) ... [2022-07-20 05:09:48,394 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:48" (1/1) ... [2022-07-20 05:09:48,397 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:48" (1/1) ... [2022-07-20 05:09:48,397 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:48" (1/1) ... [2022-07-20 05:09:48,402 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:48" (1/1) ... [2022-07-20 05:09:48,406 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:48" (1/1) ... [2022-07-20 05:09:48,408 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:48" (1/1) ... [2022-07-20 05:09:48,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:09:48,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:09:48,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:09:48,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:09:48,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:09:48,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:09:48,448 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:48,472 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:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:09:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:09:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:09:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:09:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:09:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:09:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:09:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:09:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:09:48,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:09:48,599 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:09:48,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:09:48,929 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:09:48,934 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:09:48,935 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-20 05:09:48,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:09:48 BoogieIcfgContainer [2022-07-20 05:09:48,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:09:48,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:09:48,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:09:48,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:09:48,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:09:48" (1/3) ... [2022-07-20 05:09:48,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202f937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:09:48, skipping insertion in model container [2022-07-20 05:09:48,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (2/3) ... [2022-07-20 05:09:48,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202f937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:09:48, skipping insertion in model container [2022-07-20 05:09:48,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:09:48" (3/3) ... [2022-07-20 05:09:48,947 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2022-07-20 05:09:48,958 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:09:48,958 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-07-20 05:09:49,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:09:49,016 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@7dc930b6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74c0d348 [2022-07-20 05:09:49,016 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-07-20 05:09:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 58 states have (on average 2.189655172413793) internal successors, (127), 108 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:09:49,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:49,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:09:49,035 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:49,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:49,042 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 05:09:49,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:49,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141213931] [2022-07-20 05:09:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:49,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:49,184 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:49,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:49,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141213931] [2022-07-20 05:09:49,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141213931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:49,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:49,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:09:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885110424] [2022-07-20 05:09:49,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:49,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:09:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:49,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:09:49,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:49,220 INFO L87 Difference]: Start difference. First operand has 109 states, 58 states have (on average 2.189655172413793) internal successors, (127), 108 states have internal predecessors, (127), 0 states have call successors, (0), 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:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:49,325 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-07-20 05:09:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:09:49,328 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:49,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:49,333 INFO L225 Difference]: With dead ends: 115 [2022-07-20 05:09:49,334 INFO L226 Difference]: Without dead ends: 113 [2022-07-20 05:09:49,335 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:49,337 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 93 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:49,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 80 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-20 05:09:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-07-20 05:09:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 57 states have (on average 1.912280701754386) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2022-07-20 05:09:49,376 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 3 [2022-07-20 05:09:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:49,377 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2022-07-20 05:09:49,377 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:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-07-20 05:09:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:09:49,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:49,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:09:49,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:09:49,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:49,380 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 05:09:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:49,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650208274] [2022-07-20 05:09:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:49,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:49,448 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:49,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:49,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650208274] [2022-07-20 05:09:49,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650208274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:49,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:49,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:09:49,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81026079] [2022-07-20 05:09:49,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:49,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:09:49,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:49,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:09:49,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:49,453 INFO L87 Difference]: Start difference. First operand 103 states and 109 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:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:49,529 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-07-20 05:09:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:09:49,530 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:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:49,533 INFO L225 Difference]: With dead ends: 111 [2022-07-20 05:09:49,533 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 05:09:49,535 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:49,536 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 91 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:49,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 80 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 05:09:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2022-07-20 05:09:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 98 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2022-07-20 05:09:49,568 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 3 [2022-07-20 05:09:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:49,569 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2022-07-20 05:09:49,569 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:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2022-07-20 05:09:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:09:49,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:49,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:49,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:09:49,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:49,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash 59263659, now seen corresponding path program 1 times [2022-07-20 05:09:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:49,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463598788] [2022-07-20 05:09:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:49,664 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:49,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:49,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463598788] [2022-07-20 05:09:49,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463598788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:49,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:49,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:09:49,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585168562] [2022-07-20 05:09:49,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:49,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:09:49,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:49,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:09:49,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:09:49,666 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:49,763 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-07-20 05:09:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:09:49,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 05:09:49,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:49,765 INFO L225 Difference]: With dead ends: 96 [2022-07-20 05:09:49,767 INFO L226 Difference]: Without dead ends: 96 [2022-07-20 05:09:49,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:09:49,768 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:49,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-20 05:09:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2022-07-20 05:09:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.631578947368421) internal successors, (93), 86 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-07-20 05:09:49,773 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 8 [2022-07-20 05:09:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:49,774 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-07-20 05:09:49,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-07-20 05:09:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:09:49,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:49,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:49,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:09:49,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash 59263660, now seen corresponding path program 1 times [2022-07-20 05:09:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:49,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964496617] [2022-07-20 05:09:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:49,834 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:49,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:49,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964496617] [2022-07-20 05:09:49,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964496617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:49,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:49,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:09:49,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864069482] [2022-07-20 05:09:49,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:49,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:09:49,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:49,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:09:49,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:09:49,838 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:49,960 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-07-20 05:09:49,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:09:49,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 05:09:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:49,962 INFO L225 Difference]: With dead ends: 112 [2022-07-20 05:09:49,962 INFO L226 Difference]: Without dead ends: 112 [2022-07-20 05:09:49,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:09:49,963 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 103 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:49,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 101 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-20 05:09:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2022-07-20 05:09:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-07-20 05:09:49,968 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 8 [2022-07-20 05:09:49,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:49,968 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-07-20 05:09:49,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-07-20 05:09:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:09:49,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:49,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:49,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:09:49,969 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:49,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:49,969 INFO L85 PathProgramCache]: Analyzing trace with hash 292159279, now seen corresponding path program 1 times [2022-07-20 05:09:49,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:49,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691199996] [2022-07-20 05:09:49,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:49,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:50,038 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:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:50,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691199996] [2022-07-20 05:09:50,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691199996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:50,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:50,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:09:50,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091013666] [2022-07-20 05:09:50,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:50,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:09:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:09:50,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:09:50,039 INFO L87 Difference]: Start difference. First operand 96 states and 105 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:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:50,120 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-07-20 05:09:50,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:09:50,120 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:50,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:50,121 INFO L225 Difference]: With dead ends: 95 [2022-07-20 05:09:50,121 INFO L226 Difference]: Without dead ends: 95 [2022-07-20 05:09:50,121 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:50,122 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 9 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:50,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 228 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-20 05:09:50,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-07-20 05:09:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 94 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-07-20 05:09:50,126 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 11 [2022-07-20 05:09:50,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:50,126 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-07-20 05:09:50,126 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:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-07-20 05:09:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:09:50,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:50,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:50,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:09:50,127 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:50,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash 292159280, now seen corresponding path program 1 times [2022-07-20 05:09:50,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:50,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838850809] [2022-07-20 05:09:50,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:50,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:50,203 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:50,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:50,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838850809] [2022-07-20 05:09:50,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838850809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:50,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:50,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:09:50,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184431088] [2022-07-20 05:09:50,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:50,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:09:50,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:50,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:09:50,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:09:50,206 INFO L87 Difference]: Start difference. First operand 95 states and 103 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:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:50,296 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-07-20 05:09:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:09:50,297 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:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:50,298 INFO L225 Difference]: With dead ends: 94 [2022-07-20 05:09:50,299 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 05:09:50,299 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:50,302 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:50,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 223 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 05:09:50,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-20 05:09:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-07-20 05:09:50,318 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 11 [2022-07-20 05:09:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:50,318 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-07-20 05:09:50,318 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:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-07-20 05:09:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:09:50,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:50,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:50,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:09:50,320 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 467005134, now seen corresponding path program 1 times [2022-07-20 05:09:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:50,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560289827] [2022-07-20 05:09:50,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:50,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:50,421 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:50,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:50,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560289827] [2022-07-20 05:09:50,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560289827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:50,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:50,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:09:50,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217208694] [2022-07-20 05:09:50,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:50,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:09:50,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:09:50,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:09:50,424 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:50,571 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2022-07-20 05:09:50,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:09:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:50,572 INFO L225 Difference]: With dead ends: 177 [2022-07-20 05:09:50,572 INFO L226 Difference]: Without dead ends: 177 [2022-07-20 05:09:50,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:09:50,573 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 279 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:50,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 380 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-20 05:09:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2022-07-20 05:09:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 96 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-07-20 05:09:50,575 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 12 [2022-07-20 05:09:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:50,576 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-07-20 05:09:50,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-07-20 05:09:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:09:50,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:50,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:50,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:09:50,576 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:50,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1592261436, now seen corresponding path program 1 times [2022-07-20 05:09:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:50,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852549716] [2022-07-20 05:09:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:50,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:50,678 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:50,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:50,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852549716] [2022-07-20 05:09:50,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852549716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:50,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:50,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:09:50,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003999065] [2022-07-20 05:09:50,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:50,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:09:50,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:50,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:09:50,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:09:50,680 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:50,824 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2022-07-20 05:09:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:09:50,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 05:09:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:50,825 INFO L225 Difference]: With dead ends: 139 [2022-07-20 05:09:50,825 INFO L226 Difference]: Without dead ends: 139 [2022-07-20 05:09:50,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:09:50,825 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 314 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:50,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 210 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-20 05:09:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2022-07-20 05:09:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 98 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-07-20 05:09:50,828 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 13 [2022-07-20 05:09:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:50,828 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-07-20 05:09:50,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-07-20 05:09:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:09:50,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:50,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:50,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:09:50,828 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:50,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1592261437, now seen corresponding path program 1 times [2022-07-20 05:09:50,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:50,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296269620] [2022-07-20 05:09:50,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:50,977 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:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:50,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296269620] [2022-07-20 05:09:50,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296269620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:50,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:50,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:09:50,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865172023] [2022-07-20 05:09:50,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:50,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:09:50,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:50,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:09:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:09:50,979 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:51,121 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2022-07-20 05:09:51,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:09:51,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 05:09:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:51,122 INFO L225 Difference]: With dead ends: 171 [2022-07-20 05:09:51,122 INFO L226 Difference]: Without dead ends: 171 [2022-07-20 05:09:51,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:09:51,123 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 324 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:51,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 216 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-20 05:09:51,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 111. [2022-07-20 05:09:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.5060240963855422) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-07-20 05:09:51,125 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 13 [2022-07-20 05:09:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:51,125 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-07-20 05:09:51,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-07-20 05:09:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:09:51,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:51,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:51,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 05:09:51,126 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:51,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1089000433, now seen corresponding path program 1 times [2022-07-20 05:09:51,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:51,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567460598] [2022-07-20 05:09:51,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:51,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:51,229 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:51,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:51,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567460598] [2022-07-20 05:09:51,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567460598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:51,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:51,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:09:51,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971521769] [2022-07-20 05:09:51,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:51,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:09:51,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:51,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:09:51,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:09:51,231 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 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:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:51,361 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2022-07-20 05:09:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:09:51,362 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-20 05:09:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:51,362 INFO L225 Difference]: With dead ends: 119 [2022-07-20 05:09:51,362 INFO L226 Difference]: Without dead ends: 119 [2022-07-20 05:09:51,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:09:51,363 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 171 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:51,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 172 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-20 05:09:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2022-07-20 05:09:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 109 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:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2022-07-20 05:09:51,365 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 15 [2022-07-20 05:09:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:51,365 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2022-07-20 05:09:51,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 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:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2022-07-20 05:09:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:09:51,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:51,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:51,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 05:09:51,366 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:51,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:51,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1089000434, now seen corresponding path program 1 times [2022-07-20 05:09:51,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:51,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352297572] [2022-07-20 05:09:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:51,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:51,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352297572] [2022-07-20 05:09:51,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352297572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:51,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:51,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:09:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169947249] [2022-07-20 05:09:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:51,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:09:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:51,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:09:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:09:51,475 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 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:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:51,756 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-07-20 05:09:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:09:51,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-20 05:09:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:51,757 INFO L225 Difference]: With dead ends: 114 [2022-07-20 05:09:51,757 INFO L226 Difference]: Without dead ends: 114 [2022-07-20 05:09:51,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-20 05:09:51,758 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 160 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:51,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 211 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:09:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-20 05:09:51,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2022-07-20 05:09:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 97 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2022-07-20 05:09:51,760 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 15 [2022-07-20 05:09:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:51,760 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2022-07-20 05:09:51,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 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:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-07-20 05:09:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:09:51,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:51,760 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:51,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 05:09:51,760 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:51,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1441707388, now seen corresponding path program 1 times [2022-07-20 05:09:51,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:51,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287798525] [2022-07-20 05:09:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:51,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:51,869 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:51,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287798525] [2022-07-20 05:09:51,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287798525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:51,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:51,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:09:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289534703] [2022-07-20 05:09:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:51,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:09:51,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:51,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:09:51,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:09:51,872 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:52,111 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-07-20 05:09:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:09:52,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:52,112 INFO L225 Difference]: With dead ends: 146 [2022-07-20 05:09:52,112 INFO L226 Difference]: Without dead ends: 146 [2022-07-20 05:09:52,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:09:52,112 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 333 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:52,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 319 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-20 05:09:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2022-07-20 05:09:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 97 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-07-20 05:09:52,114 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 16 [2022-07-20 05:09:52,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:52,114 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-07-20 05:09:52,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:52,114 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-07-20 05:09:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:09:52,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:52,115 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:52,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 05:09:52,115 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:52,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1441707389, now seen corresponding path program 1 times [2022-07-20 05:09:52,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:52,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928543509] [2022-07-20 05:09:52,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:52,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:52,209 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:52,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:52,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928543509] [2022-07-20 05:09:52,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928543509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:52,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:52,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:09:52,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181154892] [2022-07-20 05:09:52,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:52,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:09:52,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:52,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:09:52,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:09:52,211 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:52,417 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2022-07-20 05:09:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:09:52,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:52,418 INFO L225 Difference]: With dead ends: 156 [2022-07-20 05:09:52,418 INFO L226 Difference]: Without dead ends: 156 [2022-07-20 05:09:52,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:09:52,419 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 180 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:52,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 254 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-20 05:09:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 98. [2022-07-20 05:09:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-07-20 05:09:52,421 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 16 [2022-07-20 05:09:52,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:52,421 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-07-20 05:09:52,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-07-20 05:09:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:09:52,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:52,422 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:52,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 05:09:52,422 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:52,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1743241268, now seen corresponding path program 1 times [2022-07-20 05:09:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:52,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498360672] [2022-07-20 05:09:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:52,474 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:52,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:52,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498360672] [2022-07-20 05:09:52,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498360672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:52,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:52,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:09:52,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334025073] [2022-07-20 05:09:52,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:52,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:09:52,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:09:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:09:52,476 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:52,653 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2022-07-20 05:09:52,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:09:52,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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:52,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:52,654 INFO L225 Difference]: With dead ends: 137 [2022-07-20 05:09:52,654 INFO L226 Difference]: Without dead ends: 137 [2022-07-20 05:09:52,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:09:52,655 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 243 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:52,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 209 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-20 05:09:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2022-07-20 05:09:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.5) internal successors, (141), 114 states have internal predecessors, (141), 0 states have call successors, (0), 0 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:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2022-07-20 05:09:52,657 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 17 [2022-07-20 05:09:52,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:52,658 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2022-07-20 05:09:52,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2022-07-20 05:09:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:09:52,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:52,658 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:52,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 05:09:52,659 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:52,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1743241269, now seen corresponding path program 1 times [2022-07-20 05:09:52,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:52,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443714333] [2022-07-20 05:09:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:52,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:52,747 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:52,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:52,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443714333] [2022-07-20 05:09:52,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443714333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:52,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:52,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:09:52,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356842991] [2022-07-20 05:09:52,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:52,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:09:52,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:52,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:09:52,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:09:52,749 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:52,943 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2022-07-20 05:09:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:09:52,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:52,944 INFO L225 Difference]: With dead ends: 158 [2022-07-20 05:09:52,944 INFO L226 Difference]: Without dead ends: 158 [2022-07-20 05:09:52,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:09:52,945 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 185 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:52,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 243 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-20 05:09:52,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 120. [2022-07-20 05:09:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 119 states have internal predecessors, (146), 0 states have call successors, (0), 0 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:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-07-20 05:09:52,947 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 17 [2022-07-20 05:09:52,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:52,947 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-07-20 05:09:52,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-07-20 05:09:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:09:52,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:52,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:52,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 05:09:52,948 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:52,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1843781729, now seen corresponding path program 1 times [2022-07-20 05:09:52,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:52,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000309469] [2022-07-20 05:09:52,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:52,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:53,015 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:53,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:53,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000309469] [2022-07-20 05:09:53,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000309469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:53,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:53,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:09:53,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949674258] [2022-07-20 05:09:53,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:53,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:09:53,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:53,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:09:53,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:09:53,017 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:53,172 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-07-20 05:09:53,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:09:53,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 05:09:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:53,173 INFO L225 Difference]: With dead ends: 154 [2022-07-20 05:09:53,173 INFO L226 Difference]: Without dead ends: 154 [2022-07-20 05:09:53,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:09:53,173 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 135 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:53,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 335 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-20 05:09:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2022-07-20 05:09:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2022-07-20 05:09:53,176 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 20 [2022-07-20 05:09:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:53,176 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2022-07-20 05:09:53,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2022-07-20 05:09:53,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:09:53,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:53,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:53,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 05:09:53,176 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:53,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1400081941, now seen corresponding path program 1 times [2022-07-20 05:09:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:53,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812756832] [2022-07-20 05:09:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:53,297 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:53,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:53,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812756832] [2022-07-20 05:09:53,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812756832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:53,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:53,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 05:09:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320109812] [2022-07-20 05:09:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:53,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:09:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:53,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:09:53,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:09:53,299 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:53,629 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2022-07-20 05:09:53,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:09:53,630 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 05:09:53,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:53,630 INFO L225 Difference]: With dead ends: 144 [2022-07-20 05:09:53,630 INFO L226 Difference]: Without dead ends: 144 [2022-07-20 05:09:53,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-07-20 05:09:53,631 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 221 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:53,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 562 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:09:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-20 05:09:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2022-07-20 05:09:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.46) internal successors, (146), 120 states have internal predecessors, (146), 0 states have call successors, (0), 0 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:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2022-07-20 05:09:53,633 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 20 [2022-07-20 05:09:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:53,633 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2022-07-20 05:09:53,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2022-07-20 05:09:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:09:53,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:53,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:53,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 05:09:53,634 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:53,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1168177799, now seen corresponding path program 1 times [2022-07-20 05:09:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:53,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229167195] [2022-07-20 05:09:53,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:53,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:53,670 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:53,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:53,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229167195] [2022-07-20 05:09:53,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229167195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:53,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:53,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:09:53,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279704319] [2022-07-20 05:09:53,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:53,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:09:53,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:53,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:09:53,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:09:53,672 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:53,737 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2022-07-20 05:09:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:09:53,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 05:09:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:53,738 INFO L225 Difference]: With dead ends: 120 [2022-07-20 05:09:53,738 INFO L226 Difference]: Without dead ends: 120 [2022-07-20 05:09:53,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:09:53,738 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 189 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:53,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 99 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-20 05:09:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-07-20 05:09:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 118 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2022-07-20 05:09:53,741 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 20 [2022-07-20 05:09:53,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:53,741 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2022-07-20 05:09:53,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2022-07-20 05:09:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:09:53,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:53,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:53,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 05:09:53,742 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:53,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:53,742 INFO L85 PathProgramCache]: Analyzing trace with hash -453239385, now seen corresponding path program 1 times [2022-07-20 05:09:53,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:53,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292788135] [2022-07-20 05:09:53,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:53,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:53,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:53,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292788135] [2022-07-20 05:09:53,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292788135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:53,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:53,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:09:53,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697982096] [2022-07-20 05:09:53,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:53,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:09:53,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:53,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:09:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:09:53,766 INFO L87 Difference]: Start difference. First operand 119 states and 144 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:53,832 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2022-07-20 05:09:53,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:09:53,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 05:09:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:53,834 INFO L225 Difference]: With dead ends: 120 [2022-07-20 05:09:53,834 INFO L226 Difference]: Without dead ends: 120 [2022-07-20 05:09:53,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:09:53,835 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:53,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 162 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-20 05:09:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2022-07-20 05:09:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 117 states have internal predecessors, (141), 0 states have call successors, (0), 0 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:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2022-07-20 05:09:53,838 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 21 [2022-07-20 05:09:53,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:53,838 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2022-07-20 05:09:53,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2022-07-20 05:09:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:09:53,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:53,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:53,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 05:09:53,839 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:53,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash -453239384, now seen corresponding path program 1 times [2022-07-20 05:09:53,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:53,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228395772] [2022-07-20 05:09:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:53,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:53,949 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:53,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:53,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228395772] [2022-07-20 05:09:53,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228395772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:53,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:53,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:09:53,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38457426] [2022-07-20 05:09:53,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:53,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:09:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:53,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:09:53,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:09:53,951 INFO L87 Difference]: Start difference. First operand 118 states and 141 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:54,196 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2022-07-20 05:09:54,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:09:54,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 05:09:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:54,197 INFO L225 Difference]: With dead ends: 149 [2022-07-20 05:09:54,197 INFO L226 Difference]: Without dead ends: 149 [2022-07-20 05:09:54,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:09:54,197 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 188 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:54,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 288 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:09:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-20 05:09:54,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 118. [2022-07-20 05:09:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 117 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 140 transitions. [2022-07-20 05:09:54,199 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 140 transitions. Word has length 21 [2022-07-20 05:09:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:54,199 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 140 transitions. [2022-07-20 05:09:54,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2022-07-20 05:09:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 05:09:54,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:54,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:54,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 05:09:54,200 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:54,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1947258978, now seen corresponding path program 1 times [2022-07-20 05:09:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:54,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401326445] [2022-07-20 05:09:54,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:54,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:54,301 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:54,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:54,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401326445] [2022-07-20 05:09:54,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401326445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:54,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:54,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:09:54,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407291920] [2022-07-20 05:09:54,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:54,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:09:54,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:54,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:09:54,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:09:54,303 INFO L87 Difference]: Start difference. First operand 118 states and 140 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:54,500 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-07-20 05:09:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:09:54,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 05:09:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:54,501 INFO L225 Difference]: With dead ends: 136 [2022-07-20 05:09:54,501 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 05:09:54,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:09:54,501 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 220 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:54,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 396 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 05:09:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2022-07-20 05:09:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.404040404040404) internal successors, (139), 117 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2022-07-20 05:09:54,504 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 22 [2022-07-20 05:09:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:54,504 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2022-07-20 05:09:54,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-07-20 05:09:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:09:54,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:54,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:54,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 05:09:54,504 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-20 05:09:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash 922767525, now seen corresponding path program 1 times [2022-07-20 05:09:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:54,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016678148] [2022-07-20 05:09:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:09:54,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 05:09:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:09:54,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 05:09:54,536 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 05:09:54,536 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (49 of 50 remaining) [2022-07-20 05:09:54,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2022-07-20 05:09:54,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2022-07-20 05:09:54,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2022-07-20 05:09:54,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2022-07-20 05:09:54,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2022-07-20 05:09:54,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2022-07-20 05:09:54,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2022-07-20 05:09:54,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2022-07-20 05:09:54,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2022-07-20 05:09:54,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2022-07-20 05:09:54,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2022-07-20 05:09:54,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2022-07-20 05:09:54,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2022-07-20 05:09:54,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2022-07-20 05:09:54,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2022-07-20 05:09:54,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2022-07-20 05:09:54,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (32 of 50 remaining) [2022-07-20 05:09:54,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2022-07-20 05:09:54,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2022-07-20 05:09:54,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2022-07-20 05:09:54,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2022-07-20 05:09:54,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (27 of 50 remaining) [2022-07-20 05:09:54,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2022-07-20 05:09:54,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2022-07-20 05:09:54,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2022-07-20 05:09:54,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2022-07-20 05:09:54,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2022-07-20 05:09:54,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2022-07-20 05:09:54,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2022-07-20 05:09:54,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2022-07-20 05:09:54,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2022-07-20 05:09:54,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2022-07-20 05:09:54,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2022-07-20 05:09:54,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2022-07-20 05:09:54,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2022-07-20 05:09:54,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2022-07-20 05:09:54,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2022-07-20 05:09:54,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2022-07-20 05:09:54,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2022-07-20 05:09:54,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2022-07-20 05:09:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2022-07-20 05:09:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2022-07-20 05:09:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (6 of 50 remaining) [2022-07-20 05:09:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (5 of 50 remaining) [2022-07-20 05:09:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (4 of 50 remaining) [2022-07-20 05:09:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (3 of 50 remaining) [2022-07-20 05:09:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (2 of 50 remaining) [2022-07-20 05:09:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (1 of 50 remaining) [2022-07-20 05:09:54,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2022-07-20 05:09:54,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 05:09:54,546 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:54,549 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 05:09:54,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:09:54 BoogieIcfgContainer [2022-07-20 05:09:54,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 05:09:54,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 05:09:54,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 05:09:54,569 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 05:09:54,569 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:48" (3/4) ... [2022-07-20 05:09:54,570 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-20 05:09:54,592 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 05:09:54,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 05:09:54,593 INFO L158 Benchmark]: Toolchain (without parser) took 6540.65ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 96.3MB in the beginning and 109.5MB in the end (delta: -13.2MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-07-20 05:09:54,593 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 136.3MB. Free memory was 114.3MB in the beginning and 114.2MB in the end (delta: 76.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:09:54,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.62ms. Allocated memory is still 136.3MB. Free memory was 96.1MB in the beginning and 103.2MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 05:09:54,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.04ms. Allocated memory is still 136.3MB. Free memory was 102.7MB in the beginning and 101.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:09:54,593 INFO L158 Benchmark]: Boogie Preprocessor took 26.76ms. Allocated memory is still 136.3MB. Free memory was 101.1MB in the beginning and 99.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:09:54,594 INFO L158 Benchmark]: RCFGBuilder took 522.93ms. Allocated memory is still 136.3MB. Free memory was 99.2MB in the beginning and 81.3MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-20 05:09:54,594 INFO L158 Benchmark]: TraceAbstraction took 5627.96ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 80.8MB in the beginning and 111.6MB in the end (delta: -30.8MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2022-07-20 05:09:54,594 INFO L158 Benchmark]: Witness Printer took 23.84ms. Allocated memory is still 184.5MB. Free memory was 111.6MB in the beginning and 109.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:09:54,595 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 136.3MB. Free memory was 114.3MB in the beginning and 114.2MB in the end (delta: 76.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.62ms. Allocated memory is still 136.3MB. Free memory was 96.1MB in the beginning and 103.2MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.04ms. Allocated memory is still 136.3MB. Free memory was 102.7MB in the beginning and 101.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.76ms. Allocated memory is still 136.3MB. Free memory was 101.1MB in the beginning and 99.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.93ms. Allocated memory is still 136.3MB. Free memory was 99.2MB in the beginning and 81.3MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5627.96ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 80.8MB in the beginning and 111.6MB in the end (delta: -30.8MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Witness Printer took 23.84ms. Allocated memory is still 184.5MB. Free memory was 111.6MB in the beginning and 109.5MB 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: 1034]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = head VAL [head={-1:0}] [L999] head->data = 0 VAL [head={-1:0}] [L1001] SLL* x = head; [L1002] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1027] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1029] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, state=1, x={-1:0}] [L1029] x = head->next [L1030] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1032] COND TRUE x->data != 0 [L1034] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1034] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1] [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1034] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1034] reach_error() VAL [head={-1:0}, state=1, 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: 1025]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - 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: 1030]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - 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: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: 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, 109 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3622 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3622 mSDsluCounter, 4822 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3558 mSDsCounter, 314 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4180 IncrementalHoareTripleChecker+Invalid, 4494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 314 mSolverCounterUnsat, 1264 mSDtfsCounter, 4180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=16, InterpolantAutomatonStates: 176, 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, 21 MinimizatonAttempts, 526 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 3132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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:54,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)