./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:50:12,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:50:12,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:50:12,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:50:12,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:50:12,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:50:12,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:50:12,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:50:12,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:50:12,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:50:12,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:50:12,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:50:12,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:50:12,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:50:12,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:50:12,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:50:12,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:50:12,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:50:12,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:50:12,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:50:12,291 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:50:12,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:50:12,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:50:12,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:50:12,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:50:12,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:50:12,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:50:12,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:50:12,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:50:12,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:50:12,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:50:12,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:50:12,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:50:12,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:50:12,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:50:12,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:50:12,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:50:12,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:50:12,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:50:12,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:50:12,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:50:12,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:50:12,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-14 05:50:12,336 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:50:12,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:50:12,337 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:50:12,337 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:50:12,337 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:50:12,338 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:50:12,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:50:12,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:50:12,338 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:50:12,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:50:12,339 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:50:12,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:50:12,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:50:12,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:50:12,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:50:12,340 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:50:12,340 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:50:12,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:50:12,340 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:50:12,341 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:50:12,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:50:12,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:50:12,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:50:12,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:50:12,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:12,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:50:12,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:50:12,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 05:50:12,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 05:50:12,343 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 -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2022-07-14 05:50:12,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:50:12,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:50:12,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:50:12,564 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:50:12,564 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:50:12,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2022-07-14 05:50:12,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85224b1c/c4a9916ba90940e18269c8e802635cc3/FLAGb12dce7db [2022-07-14 05:50:12,990 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:50:12,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2022-07-14 05:50:13,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85224b1c/c4a9916ba90940e18269c8e802635cc3/FLAGb12dce7db [2022-07-14 05:50:13,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85224b1c/c4a9916ba90940e18269c8e802635cc3 [2022-07-14 05:50:13,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:50:13,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:50:13,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:13,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:50:13,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:50:13,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e4d1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13, skipping insertion in model container [2022-07-14 05:50:13,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:50:13,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:13,243 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/heap-manipulation/dll_of_dll-2.i[22634,22647] [2022-07-14 05:50:13,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:13,300 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:50:13,328 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/heap-manipulation/dll_of_dll-2.i[22634,22647] [2022-07-14 05:50:13,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:13,384 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:50:13,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13 WrapperNode [2022-07-14 05:50:13,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:13,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:13,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:50:13,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:50:13,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,448 INFO L137 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 234 [2022-07-14 05:50:13,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:13,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:50:13,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:50:13,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:50:13,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:50:13,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:50:13,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:50:13,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:50:13,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:13,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:13,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 05:50:13,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 05:50:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-14 05:50:13,594 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-14 05:50:13,594 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2022-07-14 05:50:13,594 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2022-07-14 05:50:13,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 05:50:13,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 05:50:13,594 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2022-07-14 05:50:13,594 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2022-07-14 05:50:13,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 05:50:13,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 05:50:13,595 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 05:50:13,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 05:50:13,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 05:50:13,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:50:13,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 05:50:13,596 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2022-07-14 05:50:13,596 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2022-07-14 05:50:13,596 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2022-07-14 05:50:13,596 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2022-07-14 05:50:13,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 05:50:13,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:50:13,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:50:13,719 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:50:13,721 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:50:14,156 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:50:14,162 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:50:14,163 INFO L299 CfgBuilder]: Removed 38 assume(true) statements. [2022-07-14 05:50:14,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:14 BoogieIcfgContainer [2022-07-14 05:50:14,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:50:14,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:50:14,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:50:14,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:50:14,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:50:13" (1/3) ... [2022-07-14 05:50:14,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c670ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:14, skipping insertion in model container [2022-07-14 05:50:14,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (2/3) ... [2022-07-14 05:50:14,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c670ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:14, skipping insertion in model container [2022-07-14 05:50:14,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:14" (3/3) ... [2022-07-14 05:50:14,187 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2022-07-14 05:50:14,196 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:50:14,197 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2022-07-14 05:50:14,232 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:50:14,238 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@69cea23c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@159f0117 [2022-07-14 05:50:14,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2022-07-14 05:50:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 271 states, 142 states have (on average 2.1619718309859155) internal successors, (307), 259 states have internal predecessors, (307), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-14 05:50:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 05:50:14,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:14,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:14,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:14,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:14,262 INFO L85 PathProgramCache]: Analyzing trace with hash -853608627, now seen corresponding path program 1 times [2022-07-14 05:50:14,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:14,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684131971] [2022-07-14 05:50:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:14,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:14,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:14,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684131971] [2022-07-14 05:50:14,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684131971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:14,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:14,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:14,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299276713] [2022-07-14 05:50:14,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:14,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 05:50:14,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:14,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 05:50:14,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 05:50:14,509 INFO L87 Difference]: Start difference. First operand has 271 states, 142 states have (on average 2.1619718309859155) internal successors, (307), 259 states have internal predecessors, (307), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:14,551 INFO L93 Difference]: Finished difference Result 269 states and 299 transitions. [2022-07-14 05:50:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 05:50:14,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 05:50:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:14,566 INFO L225 Difference]: With dead ends: 269 [2022-07-14 05:50:14,566 INFO L226 Difference]: Without dead ends: 267 [2022-07-14 05:50:14,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 05:50:14,570 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:14,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-14 05:50:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2022-07-14 05:50:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 140 states have (on average 1.8785714285714286) internal successors, (263), 255 states have internal predecessors, (263), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 05:50:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 297 transitions. [2022-07-14 05:50:14,638 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 297 transitions. Word has length 9 [2022-07-14 05:50:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:14,639 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 297 transitions. [2022-07-14 05:50:14,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 297 transitions. [2022-07-14 05:50:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 05:50:14,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:14,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:14,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 05:50:14,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:14,645 INFO L85 PathProgramCache]: Analyzing trace with hash -853608565, now seen corresponding path program 1 times [2022-07-14 05:50:14,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:14,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710395869] [2022-07-14 05:50:14,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:14,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:14,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:14,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710395869] [2022-07-14 05:50:14,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710395869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:14,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:14,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345183290] [2022-07-14 05:50:14,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:14,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:14,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:14,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:14,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:14,761 INFO L87 Difference]: Start difference. First operand 267 states and 297 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:14,915 INFO L93 Difference]: Finished difference Result 267 states and 299 transitions. [2022-07-14 05:50:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:14,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 05:50:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:14,918 INFO L225 Difference]: With dead ends: 267 [2022-07-14 05:50:14,918 INFO L226 Difference]: Without dead ends: 267 [2022-07-14 05:50:14,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:14,919 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 23 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:14,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 463 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-14 05:50:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-07-14 05:50:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 140 states have (on average 1.8642857142857143) internal successors, (261), 253 states have internal predecessors, (261), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 05:50:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 295 transitions. [2022-07-14 05:50:14,934 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 295 transitions. Word has length 9 [2022-07-14 05:50:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:14,935 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 295 transitions. [2022-07-14 05:50:14,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 295 transitions. [2022-07-14 05:50:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 05:50:14,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:14,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:14,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 05:50:14,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:14,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:14,937 INFO L85 PathProgramCache]: Analyzing trace with hash -853608564, now seen corresponding path program 1 times [2022-07-14 05:50:14,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:14,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707858615] [2022-07-14 05:50:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,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-14 05:50:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707858615] [2022-07-14 05:50:15,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707858615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015751951] [2022-07-14 05:50:15,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:15,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:15,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:15,020 INFO L87 Difference]: Start difference. First operand 265 states and 295 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,092 INFO L93 Difference]: Finished difference Result 291 states and 329 transitions. [2022-07-14 05:50:15,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:15,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 05:50:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,094 INFO L225 Difference]: With dead ends: 291 [2022-07-14 05:50:15,094 INFO L226 Difference]: Without dead ends: 291 [2022-07-14 05:50:15,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:15,099 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 19 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1205 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-07-14 05:50:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 283. [2022-07-14 05:50:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 151 states have (on average 1.8278145695364238) internal successors, (276), 264 states have internal predecessors, (276), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2022-07-14 05:50:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 323 transitions. [2022-07-14 05:50:15,120 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 323 transitions. Word has length 9 [2022-07-14 05:50:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,120 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 323 transitions. [2022-07-14 05:50:15,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 323 transitions. [2022-07-14 05:50:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:50:15,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 05:50:15,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:15,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,122 INFO L85 PathProgramCache]: Analyzing trace with hash 33414869, now seen corresponding path program 1 times [2022-07-14 05:50:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858213085] [2022-07-14 05:50:15,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:15,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858213085] [2022-07-14 05:50:15,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858213085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:15,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028281135] [2022-07-14 05:50:15,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:15,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:15,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:15,182 INFO L87 Difference]: Start difference. First operand 283 states and 323 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,291 INFO L93 Difference]: Finished difference Result 280 states and 320 transitions. [2022-07-14 05:50:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:15,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 05:50:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,292 INFO L225 Difference]: With dead ends: 280 [2022-07-14 05:50:15,293 INFO L226 Difference]: Without dead ends: 280 [2022-07-14 05:50:15,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:15,294 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 20 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 460 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-14 05:50:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-07-14 05:50:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 151 states have (on average 1.8079470198675496) internal successors, (273), 261 states have internal predecessors, (273), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2022-07-14 05:50:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 320 transitions. [2022-07-14 05:50:15,318 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 320 transitions. Word has length 11 [2022-07-14 05:50:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,319 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 320 transitions. [2022-07-14 05:50:15,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 320 transitions. [2022-07-14 05:50:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:50:15,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 05:50:15,320 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash 33414870, now seen corresponding path program 1 times [2022-07-14 05:50:15,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135642448] [2022-07-14 05:50:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:15,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135642448] [2022-07-14 05:50:15,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135642448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:15,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552931487] [2022-07-14 05:50:15,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:15,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:15,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:15,352 INFO L87 Difference]: Start difference. First operand 280 states and 320 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,442 INFO L93 Difference]: Finished difference Result 277 states and 317 transitions. [2022-07-14 05:50:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 05:50:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,444 INFO L225 Difference]: With dead ends: 277 [2022-07-14 05:50:15,444 INFO L226 Difference]: Without dead ends: 277 [2022-07-14 05:50:15,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:15,445 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 17 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 465 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:15,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-14 05:50:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2022-07-14 05:50:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 151 states have (on average 1.7880794701986755) internal successors, (270), 258 states have internal predecessors, (270), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2022-07-14 05:50:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 317 transitions. [2022-07-14 05:50:15,452 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 317 transitions. Word has length 11 [2022-07-14 05:50:15,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,452 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 317 transitions. [2022-07-14 05:50:15,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 317 transitions. [2022-07-14 05:50:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 05:50:15,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 05:50:15,454 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting dll_insert_masterErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:15,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,454 INFO L85 PathProgramCache]: Analyzing trace with hash -226556130, now seen corresponding path program 1 times [2022-07-14 05:50:15,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940487057] [2022-07-14 05:50:15,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:15,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940487057] [2022-07-14 05:50:15,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940487057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:50:15,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878638410] [2022-07-14 05:50:15,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:50:15,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:50:15,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:15,556 INFO L87 Difference]: Start difference. First operand 277 states and 317 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,890 INFO L93 Difference]: Finished difference Result 300 states and 343 transitions. [2022-07-14 05:50:15,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:50:15,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 05:50:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,893 INFO L225 Difference]: With dead ends: 300 [2022-07-14 05:50:15,893 INFO L226 Difference]: Without dead ends: 300 [2022-07-14 05:50:15,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:50:15,894 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 120 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1153 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:15,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-14 05:50:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 289. [2022-07-14 05:50:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 162 states have (on average 1.7469135802469136) internal successors, (283), 268 states have internal predecessors, (283), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-07-14 05:50:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2022-07-14 05:50:15,902 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 16 [2022-07-14 05:50:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,903 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2022-07-14 05:50:15,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2022-07-14 05:50:15,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 05:50:15,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 05:50:15,906 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting dll_insert_masterErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:15,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,907 INFO L85 PathProgramCache]: Analyzing trace with hash -226556129, now seen corresponding path program 1 times [2022-07-14 05:50:15,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604540859] [2022-07-14 05:50:15,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:16,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:16,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604540859] [2022-07-14 05:50:16,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604540859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:16,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:16,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605391243] [2022-07-14 05:50:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:16,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:16,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:16,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:16,034 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:16,330 INFO L93 Difference]: Finished difference Result 299 states and 342 transitions. [2022-07-14 05:50:16,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:16,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 05:50:16,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:16,332 INFO L225 Difference]: With dead ends: 299 [2022-07-14 05:50:16,332 INFO L226 Difference]: Without dead ends: 299 [2022-07-14 05:50:16,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:16,333 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 80 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:16,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1016 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-14 05:50:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 289. [2022-07-14 05:50:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 162 states have (on average 1.7345679012345678) internal successors, (281), 268 states have internal predecessors, (281), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-07-14 05:50:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 330 transitions. [2022-07-14 05:50:16,342 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 330 transitions. Word has length 16 [2022-07-14 05:50:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:16,342 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 330 transitions. [2022-07-14 05:50:16,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 330 transitions. [2022-07-14 05:50:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 05:50:16,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:16,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:16,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 05:50:16,343 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting dll_insert_masterErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:16,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:16,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1322891007, now seen corresponding path program 1 times [2022-07-14 05:50:16,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:16,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353129972] [2022-07-14 05:50:16,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:16,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:16,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353129972] [2022-07-14 05:50:16,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353129972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:16,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:16,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:16,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716062073] [2022-07-14 05:50:16,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:16,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:16,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:16,409 INFO L87 Difference]: Start difference. First operand 289 states and 330 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:16,599 INFO L93 Difference]: Finished difference Result 288 states and 329 transitions. [2022-07-14 05:50:16,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:16,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 05:50:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:16,602 INFO L225 Difference]: With dead ends: 288 [2022-07-14 05:50:16,602 INFO L226 Difference]: Without dead ends: 288 [2022-07-14 05:50:16,603 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-14 05:50:16,605 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 40 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:16,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 813 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-14 05:50:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-07-14 05:50:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 162 states have (on average 1.728395061728395) internal successors, (280), 267 states have internal predecessors, (280), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-07-14 05:50:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 329 transitions. [2022-07-14 05:50:16,626 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 329 transitions. Word has length 18 [2022-07-14 05:50:16,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:16,626 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 329 transitions. [2022-07-14 05:50:16,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 329 transitions. [2022-07-14 05:50:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 05:50:16,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:16,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:16,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 05:50:16,628 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting dll_insert_masterErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:16,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1322891008, now seen corresponding path program 1 times [2022-07-14 05:50:16,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:16,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105625388] [2022-07-14 05:50:16,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:16,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:16,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105625388] [2022-07-14 05:50:16,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105625388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:16,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:16,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:16,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512254107] [2022-07-14 05:50:16,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:16,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:16,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:16,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:16,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:16,723 INFO L87 Difference]: Start difference. First operand 288 states and 329 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:16,960 INFO L93 Difference]: Finished difference Result 287 states and 328 transitions. [2022-07-14 05:50:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:16,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 05:50:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:16,961 INFO L225 Difference]: With dead ends: 287 [2022-07-14 05:50:16,962 INFO L226 Difference]: Without dead ends: 287 [2022-07-14 05:50:16,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:16,962 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 55 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:16,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 914 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:16,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-14 05:50:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2022-07-14 05:50:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 162 states have (on average 1.7222222222222223) internal successors, (279), 266 states have internal predecessors, (279), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-07-14 05:50:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 328 transitions. [2022-07-14 05:50:16,967 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 328 transitions. Word has length 18 [2022-07-14 05:50:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:16,967 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 328 transitions. [2022-07-14 05:50:16,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,968 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 328 transitions. [2022-07-14 05:50:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 05:50:16,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:16,968 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-14 05:50:16,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 05:50:16,968 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:16,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash -12061856, now seen corresponding path program 1 times [2022-07-14 05:50:16,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:16,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094893704] [2022-07-14 05:50:16,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:16,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:17,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:17,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094893704] [2022-07-14 05:50:17,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094893704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:17,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:17,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 05:50:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091320020] [2022-07-14 05:50:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:17,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 05:50:17,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:17,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 05:50:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:50:17,125 INFO L87 Difference]: Start difference. First operand 287 states and 328 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:17,438 INFO L93 Difference]: Finished difference Result 326 states and 372 transitions. [2022-07-14 05:50:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 05:50:17,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 05:50:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:17,440 INFO L225 Difference]: With dead ends: 326 [2022-07-14 05:50:17,440 INFO L226 Difference]: Without dead ends: 326 [2022-07-14 05:50:17,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-14 05:50:17,440 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 45 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:17,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1780 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-14 05:50:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 307. [2022-07-14 05:50:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 179 states have (on average 1.681564245810056) internal successors, (301), 283 states have internal predecessors, (301), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-14 05:50:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 356 transitions. [2022-07-14 05:50:17,446 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 356 transitions. Word has length 20 [2022-07-14 05:50:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:17,446 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 356 transitions. [2022-07-14 05:50:17,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 356 transitions. [2022-07-14 05:50:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 05:50:17,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:17,447 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:17,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 05:50:17,449 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:17,449 INFO L85 PathProgramCache]: Analyzing trace with hash 551710607, now seen corresponding path program 1 times [2022-07-14 05:50:17,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:17,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063412331] [2022-07-14 05:50:17,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:17,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 05:50:17,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:17,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063412331] [2022-07-14 05:50:17,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063412331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:17,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:17,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:17,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275217711] [2022-07-14 05:50:17,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:17,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:17,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:17,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:17,494 INFO L87 Difference]: Start difference. First operand 307 states and 356 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:17,574 INFO L93 Difference]: Finished difference Result 305 states and 354 transitions. [2022-07-14 05:50:17,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:17,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 05:50:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:17,578 INFO L225 Difference]: With dead ends: 305 [2022-07-14 05:50:17,578 INFO L226 Difference]: Without dead ends: 305 [2022-07-14 05:50:17,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:17,579 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 21 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:17,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 458 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-07-14 05:50:17,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2022-07-14 05:50:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 179 states have (on average 1.670391061452514) internal successors, (299), 281 states have internal predecessors, (299), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-14 05:50:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 354 transitions. [2022-07-14 05:50:17,588 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 354 transitions. Word has length 27 [2022-07-14 05:50:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:17,588 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 354 transitions. [2022-07-14 05:50:17,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 354 transitions. [2022-07-14 05:50:17,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 05:50:17,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:17,590 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:17,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 05:50:17,591 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:17,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash 67060467, now seen corresponding path program 1 times [2022-07-14 05:50:17,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:17,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476237521] [2022-07-14 05:50:17,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:17,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:17,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:17,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476237521] [2022-07-14 05:50:17,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476237521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:17,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:17,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:17,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439111374] [2022-07-14 05:50:17,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:17,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:17,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:17,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:17,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:17,679 INFO L87 Difference]: Start difference. First operand 305 states and 354 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:17,929 INFO L93 Difference]: Finished difference Result 304 states and 353 transitions. [2022-07-14 05:50:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:17,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-14 05:50:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:17,931 INFO L225 Difference]: With dead ends: 304 [2022-07-14 05:50:17,931 INFO L226 Difference]: Without dead ends: 304 [2022-07-14 05:50:17,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:17,932 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 62 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:17,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 873 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-14 05:50:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2022-07-14 05:50:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 179 states have (on average 1.6592178770949721) internal successors, (297), 279 states have internal predecessors, (297), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-14 05:50:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 352 transitions. [2022-07-14 05:50:17,941 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 352 transitions. Word has length 31 [2022-07-14 05:50:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:17,942 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 352 transitions. [2022-07-14 05:50:17,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 352 transitions. [2022-07-14 05:50:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 05:50:17,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:17,946 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:17,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 05:50:17,946 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:17,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:17,946 INFO L85 PathProgramCache]: Analyzing trace with hash 67060466, now seen corresponding path program 1 times [2022-07-14 05:50:17,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:17,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981747220] [2022-07-14 05:50:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:17,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:18,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:18,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981747220] [2022-07-14 05:50:18,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981747220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:18,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:18,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:18,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155105426] [2022-07-14 05:50:18,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:18,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:18,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:18,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:18,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:18,002 INFO L87 Difference]: Start difference. First operand 303 states and 352 transitions. Second operand has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:18,183 INFO L93 Difference]: Finished difference Result 301 states and 350 transitions. [2022-07-14 05:50:18,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:18,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-14 05:50:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:18,185 INFO L225 Difference]: With dead ends: 301 [2022-07-14 05:50:18,185 INFO L226 Difference]: Without dead ends: 301 [2022-07-14 05:50:18,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:18,185 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 74 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:18,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 975 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-14 05:50:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2022-07-14 05:50:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 179 states have (on average 1.6480446927374302) internal successors, (295), 277 states have internal predecessors, (295), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-14 05:50:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 350 transitions. [2022-07-14 05:50:18,191 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 350 transitions. Word has length 31 [2022-07-14 05:50:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:18,191 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 350 transitions. [2022-07-14 05:50:18,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 350 transitions. [2022-07-14 05:50:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 05:50:18,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:18,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:18,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 05:50:18,192 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash 20600531, now seen corresponding path program 1 times [2022-07-14 05:50:18,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:18,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494572015] [2022-07-14 05:50:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:18,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 05:50:18,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:18,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494572015] [2022-07-14 05:50:18,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494572015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:18,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:18,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:18,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466124227] [2022-07-14 05:50:18,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:18,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:18,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:18,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:18,253 INFO L87 Difference]: Start difference. First operand 301 states and 350 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:18,377 INFO L93 Difference]: Finished difference Result 300 states and 349 transitions. [2022-07-14 05:50:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:18,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-14 05:50:18,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:18,379 INFO L225 Difference]: With dead ends: 300 [2022-07-14 05:50:18,379 INFO L226 Difference]: Without dead ends: 300 [2022-07-14 05:50:18,379 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-14 05:50:18,379 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 38 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:18,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 801 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-14 05:50:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-07-14 05:50:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 179 states have (on average 1.6424581005586592) internal successors, (294), 276 states have internal predecessors, (294), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-14 05:50:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 349 transitions. [2022-07-14 05:50:18,385 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 349 transitions. Word has length 33 [2022-07-14 05:50:18,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:18,385 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 349 transitions. [2022-07-14 05:50:18,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 349 transitions. [2022-07-14 05:50:18,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 05:50:18,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:18,385 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:18,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 05:50:18,385 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:18,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash 20600532, now seen corresponding path program 1 times [2022-07-14 05:50:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:18,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194966709] [2022-07-14 05:50:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 05:50:18,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:18,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194966709] [2022-07-14 05:50:18,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194966709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:18,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:18,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:18,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449575760] [2022-07-14 05:50:18,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:18,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:18,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:18,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:18,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:18,463 INFO L87 Difference]: Start difference. First operand 300 states and 349 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:18,608 INFO L93 Difference]: Finished difference Result 299 states and 348 transitions. [2022-07-14 05:50:18,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:18,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-14 05:50:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:18,610 INFO L225 Difference]: With dead ends: 299 [2022-07-14 05:50:18,610 INFO L226 Difference]: Without dead ends: 299 [2022-07-14 05:50:18,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:18,610 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 37 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:18,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1086 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-14 05:50:18,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-07-14 05:50:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 179 states have (on average 1.6368715083798884) internal successors, (293), 275 states have internal predecessors, (293), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-14 05:50:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 348 transitions. [2022-07-14 05:50:18,616 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 348 transitions. Word has length 33 [2022-07-14 05:50:18,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:18,616 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 348 transitions. [2022-07-14 05:50:18,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 348 transitions. [2022-07-14 05:50:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 05:50:18,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:18,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:18,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 05:50:18,617 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:18,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1677723852, now seen corresponding path program 1 times [2022-07-14 05:50:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:18,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702639938] [2022-07-14 05:50:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:18,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:18,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702639938] [2022-07-14 05:50:18,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702639938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:18,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:18,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 05:50:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640496043] [2022-07-14 05:50:18,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:18,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 05:50:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:18,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 05:50:18,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:18,758 INFO L87 Difference]: Start difference. First operand 299 states and 348 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:19,080 INFO L93 Difference]: Finished difference Result 313 states and 363 transitions. [2022-07-14 05:50:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:50:19,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-14 05:50:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:19,082 INFO L225 Difference]: With dead ends: 313 [2022-07-14 05:50:19,083 INFO L226 Difference]: Without dead ends: 313 [2022-07-14 05:50:19,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-14 05:50:19,083 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 24 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:19,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1587 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-14 05:50:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 312. [2022-07-14 05:50:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 191 states have (on average 1.5968586387434556) internal successors, (305), 288 states have internal predecessors, (305), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (25), 14 states have call predecessors, (25), 18 states have call successors, (25) [2022-07-14 05:50:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 362 transitions. [2022-07-14 05:50:19,091 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 362 transitions. Word has length 35 [2022-07-14 05:50:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:19,092 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 362 transitions. [2022-07-14 05:50:19,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 362 transitions. [2022-07-14 05:50:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 05:50:19,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:19,094 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:19,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 05:50:19,094 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:19,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:19,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1451018694, now seen corresponding path program 1 times [2022-07-14 05:50:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:19,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33154471] [2022-07-14 05:50:19,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:19,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 05:50:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:50:19,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:19,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33154471] [2022-07-14 05:50:19,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33154471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:19,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467727118] [2022-07-14 05:50:19,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:19,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:19,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:19,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:19,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 05:50:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-14 05:50:19,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:19,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:19,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:19,896 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-14 05:50:19,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-14 05:50:19,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:19,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-14 05:50:19,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:19,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-14 05:50:20,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 05:50:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:50:20,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:20,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| Int)) (or (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| v_ArrVal_578) |c_##fun~$Pointer$~TO~VOID_#~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#~10#1.offset|)) 1) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:50:20,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| v_ArrVal_578) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) 1))) is different from false [2022-07-14 05:50:20,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| v_ArrVal_578) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) 1))) is different from false [2022-07-14 05:50:20,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:20,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 05:50:20,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2022-07-14 05:50:20,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-14 05:50:20,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 05:50:20,548 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:20,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-14 05:50:20,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:20,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:20,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-07-14 05:50:24,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-07-14 05:50:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-07-14 05:50:24,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467727118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:24,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:24,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 41 [2022-07-14 05:50:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048254179] [2022-07-14 05:50:24,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:24,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-14 05:50:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:24,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-14 05:50:24,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1373, Unknown=4, NotChecked=228, Total=1722 [2022-07-14 05:50:24,884 INFO L87 Difference]: Start difference. First operand 312 states and 362 transitions. Second operand has 42 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 36 states have internal predecessors, (87), 6 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 05:50:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:26,472 INFO L93 Difference]: Finished difference Result 339 states and 395 transitions. [2022-07-14 05:50:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 05:50:26,473 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 36 states have internal predecessors, (87), 6 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-07-14 05:50:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:26,474 INFO L225 Difference]: With dead ends: 339 [2022-07-14 05:50:26,474 INFO L226 Difference]: Without dead ends: 339 [2022-07-14 05:50:26,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=480, Invalid=2659, Unknown=65, NotChecked=336, Total=3540 [2022-07-14 05:50:26,475 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 310 mSDsluCounter, 3322 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 3557 SdHoareTripleChecker+Invalid, 4065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1382 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:26,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 3557 Invalid, 4065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2558 Invalid, 0 Unknown, 1382 Unchecked, 0.8s Time] [2022-07-14 05:50:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-14 05:50:26,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2022-07-14 05:50:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 206 states have (on average 1.5679611650485437) internal successors, (323), 303 states have internal predecessors, (323), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (24), 14 states have call predecessors, (24), 18 states have call successors, (24) [2022-07-14 05:50:26,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 379 transitions. [2022-07-14 05:50:26,481 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 379 transitions. Word has length 51 [2022-07-14 05:50:26,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:26,481 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 379 transitions. [2022-07-14 05:50:26,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 36 states have internal predecessors, (87), 6 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 05:50:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 379 transitions. [2022-07-14 05:50:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 05:50:26,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:26,482 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:26,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:26,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 05:50:26,707 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1451018695, now seen corresponding path program 1 times [2022-07-14 05:50:26,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:26,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630065176] [2022-07-14 05:50:26,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:26,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:26,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 05:50:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:50:26,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:26,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630065176] [2022-07-14 05:50:26,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630065176] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:26,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792047613] [2022-07-14 05:50:26,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:26,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:26,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:26,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:27,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 05:50:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:27,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-14 05:50:27,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:27,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:27,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:27,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:27,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:27,572 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-07-14 05:50:27,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 05:50:27,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:50:27,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:27,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-14 05:50:27,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:27,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-14 05:50:27,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:50:27,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 05:50:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:50:27,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:27,909 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_769 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_769) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 4))) (forall ((v_ArrVal_769 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_769) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_770) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|))))) is different from false [2022-07-14 05:50:32,364 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:32,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2022-07-14 05:50:32,368 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:32,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2022-07-14 05:50:32,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 05:50:32,430 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-14 05:50:32,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 05:50:32,454 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-14 05:50:32,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-14 05:50:32,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:32,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-14 05:50:32,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:32,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 05:50:32,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 05:50:32,550 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-14 05:50:32,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 05:50:32,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-14 05:50:32,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-14 05:50:32,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:32,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-14 05:50:32,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:32,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 05:50:32,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 05:50:32,630 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-14 05:50:32,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 05:50:32,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-14 05:50:32,656 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-14 05:50:32,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:32,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-14 05:50:32,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:32,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 05:50:32,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 05:50:32,691 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-14 05:50:32,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 05:50:32,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-14 05:50:32,715 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-14 05:50:32,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:32,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-14 05:50:32,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:32,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 05:50:32,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 05:50:32,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-14 05:50:32,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 05:50:32,774 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-14 05:50:32,778 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-14 05:50:32,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:32,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-14 05:50:32,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:32,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 05:50:32,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-14 05:50:32,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-14 05:50:32,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 61 [2022-07-14 05:50:32,894 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:32,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 93 [2022-07-14 05:50:32,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2022-07-14 05:50:32,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-07-14 05:50:33,033 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:33,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 05:50:33,040 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:33,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-14 05:50:33,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 05:50:33,073 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:33,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 05:50:33,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:33,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-14 05:50:33,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 05:50:33,104 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:33,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-14 05:50:33,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:33,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-14 05:50:33,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:33,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-14 05:50:33,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:33,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 05:50:33,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:33,315 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:50:33,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-14 05:50:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-07-14 05:50:33,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792047613] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:33,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:33,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 13] total 39 [2022-07-14 05:50:33,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195028340] [2022-07-14 05:50:33,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:33,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-14 05:50:33,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:33,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-14 05:50:33,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1374, Unknown=7, NotChecked=74, Total=1560 [2022-07-14 05:50:33,322 INFO L87 Difference]: Start difference. First operand 328 states and 379 transitions. Second operand has 40 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 35 states have internal predecessors, (94), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 05:50:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:41,431 INFO L93 Difference]: Finished difference Result 363 states and 418 transitions. [2022-07-14 05:50:41,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-14 05:50:41,456 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 35 states have internal predecessors, (94), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-07-14 05:50:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:41,460 INFO L225 Difference]: With dead ends: 363 [2022-07-14 05:50:41,460 INFO L226 Difference]: Without dead ends: 363 [2022-07-14 05:50:41,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=673, Invalid=3614, Unknown=7, NotChecked=128, Total=4422 [2022-07-14 05:50:41,462 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 342 mSDsluCounter, 3138 mSDsCounter, 0 mSdLazyCounter, 2945 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 3375 SdHoareTripleChecker+Invalid, 4473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1368 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:41,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 3375 Invalid, 4473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2945 Invalid, 0 Unknown, 1368 Unchecked, 1.4s Time] [2022-07-14 05:50:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-14 05:50:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 327. [2022-07-14 05:50:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 206 states have (on average 1.558252427184466) internal successors, (321), 302 states have internal predecessors, (321), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-14 05:50:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 376 transitions. [2022-07-14 05:50:41,471 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 376 transitions. Word has length 51 [2022-07-14 05:50:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:41,471 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 376 transitions. [2022-07-14 05:50:41,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 35 states have internal predecessors, (94), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 05:50:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 376 transitions. [2022-07-14 05:50:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 05:50:41,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:41,472 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-14 05:50:41,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-14 05:50:41,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 05:50:41,685 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:41,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash -470108245, now seen corresponding path program 1 times [2022-07-14 05:50:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:41,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077557430] [2022-07-14 05:50:41,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:41,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:41,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 05:50:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:41,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:41,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077557430] [2022-07-14 05:50:41,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077557430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:41,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445018203] [2022-07-14 05:50:41,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:41,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:41,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:41,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:41,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 05:50:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:41,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 05:50:41,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:50:41,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:41,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445018203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:41,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 05:50:41,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-07-14 05:50:41,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793606618] [2022-07-14 05:50:41,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:41,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:41,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:41,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:41,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:41,957 INFO L87 Difference]: Start difference. First operand 327 states and 376 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:41,981 INFO L93 Difference]: Finished difference Result 313 states and 349 transitions. [2022-07-14 05:50:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:41,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-07-14 05:50:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:41,983 INFO L225 Difference]: With dead ends: 313 [2022-07-14 05:50:41,983 INFO L226 Difference]: Without dead ends: 313 [2022-07-14 05:50:41,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:41,984 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 29 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:41,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1081 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-14 05:50:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-07-14 05:50:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 195 states have (on average 1.558974358974359) internal successors, (304), 291 states have internal predecessors, (304), 29 states have call successors, (29), 12 states have call predecessors, (29), 10 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-07-14 05:50:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 349 transitions. [2022-07-14 05:50:41,990 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 349 transitions. Word has length 54 [2022-07-14 05:50:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:41,991 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 349 transitions. [2022-07-14 05:50:41,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 349 transitions. [2022-07-14 05:50:41,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 05:50:41,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:41,992 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:42,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:42,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:42,205 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:42,205 INFO L85 PathProgramCache]: Analyzing trace with hash -996489836, now seen corresponding path program 1 times [2022-07-14 05:50:42,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:42,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722550948] [2022-07-14 05:50:42,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:42,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:42,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 05:50:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:42,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-14 05:50:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:42,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 05:50:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:42,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 05:50:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:50:42,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:42,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722550948] [2022-07-14 05:50:42,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722550948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:42,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072705456] [2022-07-14 05:50:42,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:42,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:42,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:42,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:42,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 05:50:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:42,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-14 05:50:42,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:42,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:42,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-14 05:50:43,228 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_1299 (Array Int Int))) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base| (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1299) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)))) is different from true [2022-07-14 05:50:43,234 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_1299 (Array Int Int))) (and (= (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1299) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-07-14 05:50:43,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2022-07-14 05:50:43,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:43,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1322 (Array Int Int)) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_40| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_40| v_ArrVal_1322) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_40| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:50:43,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072705456] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:43,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:43,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2022-07-14 05:50:43,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218731898] [2022-07-14 05:50:43,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:43,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-14 05:50:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:43,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-14 05:50:43,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=792, Unknown=9, NotChecked=174, Total=1056 [2022-07-14 05:50:43,613 INFO L87 Difference]: Start difference. First operand 313 states and 349 transitions. Second operand has 32 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-14 05:50:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:44,820 INFO L93 Difference]: Finished difference Result 333 states and 373 transitions. [2022-07-14 05:50:44,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 05:50:44,821 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-07-14 05:50:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:44,822 INFO L225 Difference]: With dead ends: 333 [2022-07-14 05:50:44,822 INFO L226 Difference]: Without dead ends: 329 [2022-07-14 05:50:44,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=1864, Unknown=21, NotChecked=270, Total=2352 [2022-07-14 05:50:44,823 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 70 mSDsluCounter, 3836 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4067 SdHoareTripleChecker+Invalid, 3466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1231 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:44,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4067 Invalid, 3466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2197 Invalid, 0 Unknown, 1231 Unchecked, 0.8s Time] [2022-07-14 05:50:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-14 05:50:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 313. [2022-07-14 05:50:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 195 states have (on average 1.5538461538461539) internal successors, (303), 291 states have internal predecessors, (303), 29 states have call successors, (29), 12 states have call predecessors, (29), 10 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-07-14 05:50:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 348 transitions. [2022-07-14 05:50:44,829 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 348 transitions. Word has length 64 [2022-07-14 05:50:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:44,830 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 348 transitions. [2022-07-14 05:50:44,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-14 05:50:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 348 transitions. [2022-07-14 05:50:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-14 05:50:44,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:44,830 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:44,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:45,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:45,044 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:45,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2033150353, now seen corresponding path program 1 times [2022-07-14 05:50:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:45,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889685290] [2022-07-14 05:50:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:45,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:45,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 05:50:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:45,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-14 05:50:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:47,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 05:50:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:48,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 05:50:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:50,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:50,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889685290] [2022-07-14 05:50:50,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889685290] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:50,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464834964] [2022-07-14 05:50:50,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:50,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:50,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:50,351 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:50,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 05:50:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:50,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-14 05:50:50,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:50,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 05:50:50,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:50,918 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 05:50:50,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 05:50:50,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-14 05:50:53,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-14 05:50:53,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:53,837 INFO L356 Elim1Store]: treesize reduction 91, result has 20.2 percent of original size [2022-07-14 05:50:53,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 46 [2022-07-14 05:50:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:53,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:54,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464834964] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:54,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:54,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 44 [2022-07-14 05:50:54,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513601641] [2022-07-14 05:50:54,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:54,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-14 05:50:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:54,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-14 05:50:54,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1906, Unknown=12, NotChecked=0, Total=2070 [2022-07-14 05:50:54,231 INFO L87 Difference]: Start difference. First operand 313 states and 348 transitions. Second operand has 45 states, 40 states have (on average 2.525) internal successors, (101), 40 states have internal predecessors, (101), 8 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 05:50:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:57,960 INFO L93 Difference]: Finished difference Result 347 states and 386 transitions. [2022-07-14 05:50:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 05:50:57,961 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.525) internal successors, (101), 40 states have internal predecessors, (101), 8 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-07-14 05:50:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:57,965 INFO L225 Difference]: With dead ends: 347 [2022-07-14 05:50:57,965 INFO L226 Difference]: Without dead ends: 347 [2022-07-14 05:50:57,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=302, Invalid=3579, Unknown=25, NotChecked=0, Total=3906 [2022-07-14 05:50:57,968 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 254 mSDsluCounter, 2438 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 4712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1572 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:57,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 2656 Invalid, 4712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3049 Invalid, 0 Unknown, 1572 Unchecked, 2.3s Time] [2022-07-14 05:50:57,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-14 05:50:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 324. [2022-07-14 05:50:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 204 states have (on average 1.5441176470588236) internal successors, (315), 298 states have internal predecessors, (315), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-07-14 05:50:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 363 transitions. [2022-07-14 05:50:57,991 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 363 transitions. Word has length 65 [2022-07-14 05:50:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:57,991 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 363 transitions. [2022-07-14 05:50:57,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.525) internal successors, (101), 40 states have internal predecessors, (101), 8 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 05:50:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 363 transitions. [2022-07-14 05:50:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-14 05:50:57,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:57,995 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:58,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:58,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:58,195 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-14 05:50:58,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2033150354, now seen corresponding path program 1 times [2022-07-14 05:50:58,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:58,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049887973] [2022-07-14 05:50:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:58,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:58,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 05:50:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:58,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-14 05:50:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat