./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a05fbc1d8a2048d37fda072c6a9d42f1f996d033c914869a4e2960aadff82dde --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:56:13,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:56:13,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:56:13,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:56:13,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:56:13,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:56:13,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:56:13,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:56:13,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:56:13,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:56:13,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:56:13,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:56:13,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:56:13,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:56:13,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:56:13,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:56:13,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:56:13,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:56:13,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:56:13,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:56:13,379 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:56:13,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:56:13,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:56:13,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:56:13,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:56:13,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:56:13,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:56:13,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:56:13,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:56:13,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:56:13,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:56:13,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:56:13,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:56:13,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:56:13,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:56:13,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:56:13,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:56:13,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:56:13,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:56:13,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:56:13,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:56:13,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:56:13,412 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:56:13,440 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:56:13,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:56:13,440 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:56:13,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:56:13,441 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:56:13,441 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:56:13,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:56:13,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:56:13,442 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:56:13,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:56:13,443 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:56:13,444 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:56:13,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:56:13,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:56:13,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:56:13,444 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:56:13,444 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:56:13,445 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:56:13,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:56:13,445 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:56:13,445 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:56:13,445 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:56:13,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:56:13,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:56:13,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:56:13,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:56:13,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:56:13,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:56:13,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:56:13,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:56:13,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a05fbc1d8a2048d37fda072c6a9d42f1f996d033c914869a4e2960aadff82dde [2022-07-21 17:56:13,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:56:13,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:56:13,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:56:13,835 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:56:13,837 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:56:13,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-07-21 17:56:13,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95bc082cf/a2e9700e05934761b955abe7afbb93ae/FLAGebb4b250f [2022-07-21 17:56:14,358 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:56:14,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-07-21 17:56:14,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95bc082cf/a2e9700e05934761b955abe7afbb93ae/FLAGebb4b250f [2022-07-21 17:56:14,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95bc082cf/a2e9700e05934761b955abe7afbb93ae [2022-07-21 17:56:14,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:56:14,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:56:14,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:56:14,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:56:14,744 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:56:14,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:56:14" (1/1) ... [2022-07-21 17:56:14,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7502eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:14, skipping insertion in model container [2022-07-21 17:56:14,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:56:14" (1/1) ... [2022-07-21 17:56:14,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:56:14,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:56:15,125 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/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2022-07-21 17:56:15,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:56:15,138 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:56:15,231 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/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2022-07-21 17:56:15,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:56:15,251 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:56:15,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:15 WrapperNode [2022-07-21 17:56:15,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:56:15,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:56:15,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:56:15,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:56:15,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:15" (1/1) ... [2022-07-21 17:56:15,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:15" (1/1) ... [2022-07-21 17:56:15,330 INFO L137 Inliner]: procedures = 29, calls = 44, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 663 [2022-07-21 17:56:15,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:56:15,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:56:15,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:56:15,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:56:15,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:15" (1/1) ... [2022-07-21 17:56:15,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:15" (1/1) ... [2022-07-21 17:56:15,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:15" (1/1) ... [2022-07-21 17:56:15,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:15" (1/1) ... [2022-07-21 17:56:15,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:15" (1/1) ... [2022-07-21 17:56:15,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:15" (1/1) ... [2022-07-21 17:56:15,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:15" (1/1) ... [2022-07-21 17:56:15,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:56:15,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:56:15,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:56:15,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:56:15,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:15" (1/1) ... [2022-07-21 17:56:15,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:56:15,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:56:15,416 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-21 17:56:15,422 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-21 17:56:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:56:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-21 17:56:15,447 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-21 17:56:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-21 17:56:15,447 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-21 17:56:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-21 17:56:15,447 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-21 17:56:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-21 17:56:15,448 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-21 17:56:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-21 17:56:15,448 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-21 17:56:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:56:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-21 17:56:15,448 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-21 17:56:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:56:15,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:56:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-21 17:56:15,449 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-21 17:56:15,563 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:56:15,565 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:56:15,668 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 17:56:15,673 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 17:56:15,676 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 17:56:15,681 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 17:56:15,684 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 17:56:16,120 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-07-21 17:56:16,120 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-07-21 17:56:16,120 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-07-21 17:56:16,120 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-07-21 17:56:16,121 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-07-21 17:56:16,121 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-07-21 17:56:16,121 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-21 17:56:16,121 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-21 17:56:16,121 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-07-21 17:56:16,121 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-07-21 17:56:16,132 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 17:56:16,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-21 17:56:16,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-21 17:56:16,158 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:56:16,165 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:56:16,166 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 17:56:16,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:56:16 BoogieIcfgContainer [2022-07-21 17:56:16,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:56:16,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:56:16,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:56:16,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:56:16,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:56:14" (1/3) ... [2022-07-21 17:56:16,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8cdc363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:56:16, skipping insertion in model container [2022-07-21 17:56:16,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:15" (2/3) ... [2022-07-21 17:56:16,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8cdc363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:56:16, skipping insertion in model container [2022-07-21 17:56:16,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:56:16" (3/3) ... [2022-07-21 17:56:16,174 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2022-07-21 17:56:16,187 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:56:16,187 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 17:56:16,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:56:16,235 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@5d962bfe, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@486aa70c [2022-07-21 17:56:16,235 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-21 17:56:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 171 states have (on average 1.6023391812865497) internal successors, (274), 190 states have internal predecessors, (274), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-21 17:56:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 17:56:16,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:16,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:16,247 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash -15799092, now seen corresponding path program 1 times [2022-07-21 17:56:16,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:16,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924806870] [2022-07-21 17:56:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:16,439 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-21 17:56:16,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:16,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924806870] [2022-07-21 17:56:16,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924806870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:16,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:16,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:56:16,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872680769] [2022-07-21 17:56:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:16,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:16,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:16,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:16,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:16,475 INFO L87 Difference]: Start difference. First operand has 210 states, 171 states have (on average 1.6023391812865497) internal successors, (274), 190 states have internal predecessors, (274), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:16,563 INFO L93 Difference]: Finished difference Result 212 states and 315 transitions. [2022-07-21 17:56:16,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:16,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-21 17:56:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:16,582 INFO L225 Difference]: With dead ends: 212 [2022-07-21 17:56:16,583 INFO L226 Difference]: Without dead ends: 208 [2022-07-21 17:56:16,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:16,589 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 179 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:16,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 419 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:16,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-21 17:56:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-07-21 17:56:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 169 states have (on average 1.5739644970414202) internal successors, (266), 186 states have internal predecessors, (266), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-21 17:56:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2022-07-21 17:56:16,656 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 8 [2022-07-21 17:56:16,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:16,656 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2022-07-21 17:56:16,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2022-07-21 17:56:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 17:56:16,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:16,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:16,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:56:16,659 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:16,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash -191249986, now seen corresponding path program 1 times [2022-07-21 17:56:16,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:16,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076157682] [2022-07-21 17:56:16,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:16,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:16,712 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-21 17:56:16,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:16,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076157682] [2022-07-21 17:56:16,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076157682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:16,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:16,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:56:16,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625996097] [2022-07-21 17:56:16,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:16,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:16,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:16,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:16,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:16,716 INFO L87 Difference]: Start difference. First operand 206 states and 310 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:16,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:16,756 INFO L93 Difference]: Finished difference Result 205 states and 309 transitions. [2022-07-21 17:56:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:16,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-21 17:56:16,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:16,759 INFO L225 Difference]: With dead ends: 205 [2022-07-21 17:56:16,759 INFO L226 Difference]: Without dead ends: 201 [2022-07-21 17:56:16,759 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-21 17:56:16,760 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 199 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:16,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 373 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:16,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-21 17:56:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-21 17:56:16,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 165 states have (on average 1.5272727272727273) internal successors, (252), 181 states have internal predecessors, (252), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-21 17:56:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2022-07-21 17:56:16,782 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 15 [2022-07-21 17:56:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:16,783 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2022-07-21 17:56:16,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2022-07-21 17:56:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 17:56:16,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:16,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:16,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:56:16,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:16,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:16,785 INFO L85 PathProgramCache]: Analyzing trace with hash 509601447, now seen corresponding path program 1 times [2022-07-21 17:56:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:16,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555822332] [2022-07-21 17:56:16,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:16,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:16,876 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-21 17:56:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:16,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555822332] [2022-07-21 17:56:16,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555822332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:16,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:16,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:56:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085755852] [2022-07-21 17:56:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:16,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:16,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:16,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:16,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:16,879 INFO L87 Difference]: Start difference. First operand 201 states and 296 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 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-21 17:56:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:16,975 INFO L93 Difference]: Finished difference Result 269 states and 381 transitions. [2022-07-21 17:56:16,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:16,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 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 19 [2022-07-21 17:56:16,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:16,977 INFO L225 Difference]: With dead ends: 269 [2022-07-21 17:56:16,978 INFO L226 Difference]: Without dead ends: 268 [2022-07-21 17:56:16,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-21 17:56:16,979 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 205 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:16,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 438 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:16,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-21 17:56:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2022-07-21 17:56:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 215 states have (on average 1.4325581395348836) internal successors, (308), 218 states have internal predecessors, (308), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2022-07-21 17:56:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2022-07-21 17:56:16,997 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 19 [2022-07-21 17:56:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:16,998 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2022-07-21 17:56:16,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 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-21 17:56:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2022-07-21 17:56:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 17:56:16,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:16,999 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-21 17:56:16,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:56:17,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:17,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043468, now seen corresponding path program 1 times [2022-07-21 17:56:17,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:17,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108379076] [2022-07-21 17:56:17,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:17,055 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-21 17:56:17,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:17,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108379076] [2022-07-21 17:56:17,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108379076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:17,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:17,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:56:17,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844753528] [2022-07-21 17:56:17,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:17,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:17,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:17,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:17,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:17,058 INFO L87 Difference]: Start difference. First operand 252 states and 361 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:17,075 INFO L93 Difference]: Finished difference Result 312 states and 436 transitions. [2022-07-21 17:56:17,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:17,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 17:56:17,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:17,078 INFO L225 Difference]: With dead ends: 312 [2022-07-21 17:56:17,078 INFO L226 Difference]: Without dead ends: 312 [2022-07-21 17:56:17,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:17,080 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 242 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:17,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 360 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-21 17:56:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 290. [2022-07-21 17:56:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 255 states have (on average 1.419607843137255) internal successors, (362), 256 states have internal predecessors, (362), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-21 17:56:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2022-07-21 17:56:17,094 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 18 [2022-07-21 17:56:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:17,095 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2022-07-21 17:56:17,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2022-07-21 17:56:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 17:56:17,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:17,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:17,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:56:17,106 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:17,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1363549369, now seen corresponding path program 1 times [2022-07-21 17:56:17,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:17,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449916588] [2022-07-21 17:56:17,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:17,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:17,160 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-21 17:56:17,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:17,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449916588] [2022-07-21 17:56:17,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449916588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:17,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:17,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:56:17,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534601957] [2022-07-21 17:56:17,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:17,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:17,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:17,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:17,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:17,163 INFO L87 Difference]: Start difference. First operand 290 states and 410 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:17,217 INFO L93 Difference]: Finished difference Result 289 states and 407 transitions. [2022-07-21 17:56:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:17,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-21 17:56:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:17,220 INFO L225 Difference]: With dead ends: 289 [2022-07-21 17:56:17,220 INFO L226 Difference]: Without dead ends: 289 [2022-07-21 17:56:17,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:17,221 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 25 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:17,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 476 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-21 17:56:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-21 17:56:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 255 states have (on average 1.411764705882353) internal successors, (360), 255 states have internal predecessors, (360), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-21 17:56:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2022-07-21 17:56:17,236 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 29 [2022-07-21 17:56:17,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:17,236 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2022-07-21 17:56:17,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2022-07-21 17:56:17,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 17:56:17,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:17,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:17,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:56:17,240 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:17,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:17,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1270637010, now seen corresponding path program 1 times [2022-07-21 17:56:17,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:17,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355271299] [2022-07-21 17:56:17,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:17,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:17,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 17:56:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:17,357 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-21 17:56:17,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:17,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355271299] [2022-07-21 17:56:17,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355271299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:17,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:17,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:56:17,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208414483] [2022-07-21 17:56:17,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:17,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:56:17,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:17,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:56:17,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:56:17,360 INFO L87 Difference]: Start difference. First operand 289 states and 407 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:17,580 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2022-07-21 17:56:17,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:56:17,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-21 17:56:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:17,582 INFO L225 Difference]: With dead ends: 307 [2022-07-21 17:56:17,583 INFO L226 Difference]: Without dead ends: 306 [2022-07-21 17:56:17,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:56:17,589 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 323 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:17,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 823 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:56:17,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-21 17:56:17,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-21 17:56:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 267 states have (on average 1.404494382022472) internal successors, (375), 266 states have internal predecessors, (375), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-21 17:56:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2022-07-21 17:56:17,606 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 33 [2022-07-21 17:56:17,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:17,606 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2022-07-21 17:56:17,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2022-07-21 17:56:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 17:56:17,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:17,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:17,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 17:56:17,609 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:17,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:17,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1113906492, now seen corresponding path program 1 times [2022-07-21 17:56:17,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:17,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837240649] [2022-07-21 17:56:17,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:17,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:17,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 17:56:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:17,775 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-21 17:56:17,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:17,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837240649] [2022-07-21 17:56:17,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837240649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:17,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:17,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:56:17,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950939799] [2022-07-21 17:56:17,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:17,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:56:17,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:17,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:56:17,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:56:17,777 INFO L87 Difference]: Start difference. First operand 301 states and 422 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:17,956 INFO L93 Difference]: Finished difference Result 306 states and 425 transitions. [2022-07-21 17:56:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:56:17,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-21 17:56:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:17,961 INFO L225 Difference]: With dead ends: 306 [2022-07-21 17:56:17,962 INFO L226 Difference]: Without dead ends: 306 [2022-07-21 17:56:17,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:56:17,964 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 331 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:17,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 632 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:17,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-21 17:56:17,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-21 17:56:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 267 states have (on average 1.400749063670412) internal successors, (374), 266 states have internal predecessors, (374), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-21 17:56:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 421 transitions. [2022-07-21 17:56:17,980 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 421 transitions. Word has length 34 [2022-07-21 17:56:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:17,981 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-21 17:56:17,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 421 transitions. [2022-07-21 17:56:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 17:56:17,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:17,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:17,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 17:56:17,988 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:17,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2136327390, now seen corresponding path program 1 times [2022-07-21 17:56:17,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:17,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555971174] [2022-07-21 17:56:17,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:17,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 17:56:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:18,062 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-21 17:56:18,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:18,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555971174] [2022-07-21 17:56:18,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555971174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:18,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:18,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:56:18,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509854428] [2022-07-21 17:56:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:18,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:56:18,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:18,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:56:18,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:18,070 INFO L87 Difference]: Start difference. First operand 301 states and 421 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:18,221 INFO L93 Difference]: Finished difference Result 282 states and 385 transitions. [2022-07-21 17:56:18,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:56:18,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-21 17:56:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:18,224 INFO L225 Difference]: With dead ends: 282 [2022-07-21 17:56:18,224 INFO L226 Difference]: Without dead ends: 282 [2022-07-21 17:56:18,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:56:18,225 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 317 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:18,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 739 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:18,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-21 17:56:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2022-07-21 17:56:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 236 states have (on average 1.3898305084745763) internal successors, (328), 235 states have internal predecessors, (328), 19 states have call successors, (19), 10 states have call predecessors, (19), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-21 17:56:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-07-21 17:56:18,234 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 34 [2022-07-21 17:56:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:18,234 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-07-21 17:56:18,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-07-21 17:56:18,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 17:56:18,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:18,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:18,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 17:56:18,236 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:18,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:18,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817048, now seen corresponding path program 1 times [2022-07-21 17:56:18,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:18,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437824915] [2022-07-21 17:56:18,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:18,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:18,266 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-21 17:56:18,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:18,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437824915] [2022-07-21 17:56:18,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437824915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:18,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:18,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:56:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975191611] [2022-07-21 17:56:18,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:18,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:56:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:18,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:56:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:56:18,269 INFO L87 Difference]: Start difference. First operand 268 states and 370 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:18,371 INFO L93 Difference]: Finished difference Result 290 states and 394 transitions. [2022-07-21 17:56:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:56:18,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-21 17:56:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:18,373 INFO L225 Difference]: With dead ends: 290 [2022-07-21 17:56:18,373 INFO L226 Difference]: Without dead ends: 290 [2022-07-21 17:56:18,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:18,374 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 296 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:18,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 430 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-21 17:56:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2022-07-21 17:56:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 236 states have (on average 1.38135593220339) internal successors, (326), 235 states have internal predecessors, (326), 19 states have call successors, (19), 10 states have call predecessors, (19), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-21 17:56:18,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 368 transitions. [2022-07-21 17:56:18,383 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 368 transitions. Word has length 34 [2022-07-21 17:56:18,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:18,383 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 368 transitions. [2022-07-21 17:56:18,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 368 transitions. [2022-07-21 17:56:18,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 17:56:18,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:18,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:18,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 17:56:18,385 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:18,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash -382146908, now seen corresponding path program 1 times [2022-07-21 17:56:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:18,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365632603] [2022-07-21 17:56:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:18,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 17:56:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:18,417 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-21 17:56:18,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:18,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365632603] [2022-07-21 17:56:18,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365632603] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:18,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:18,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:56:18,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588542596] [2022-07-21 17:56:18,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:18,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:56:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:18,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:56:18,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:56:18,420 INFO L87 Difference]: Start difference. First operand 268 states and 368 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:18,496 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2022-07-21 17:56:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:56:18,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-21 17:56:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:18,498 INFO L225 Difference]: With dead ends: 262 [2022-07-21 17:56:18,498 INFO L226 Difference]: Without dead ends: 232 [2022-07-21 17:56:18,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:18,499 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 289 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:18,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 425 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-21 17:56:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 210. [2022-07-21 17:56:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 186 states have (on average 1.39247311827957) internal successors, (259), 189 states have internal predecessors, (259), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 287 transitions. [2022-07-21 17:56:18,505 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 287 transitions. Word has length 35 [2022-07-21 17:56:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:18,506 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 287 transitions. [2022-07-21 17:56:18,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 287 transitions. [2022-07-21 17:56:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:56:18,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:18,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:18,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 17:56:18,508 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:18,508 INFO L85 PathProgramCache]: Analyzing trace with hash 758626562, now seen corresponding path program 1 times [2022-07-21 17:56:18,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:18,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260779092] [2022-07-21 17:56:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:18,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:18,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 17:56:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:56:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:18,552 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-21 17:56:18,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:18,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260779092] [2022-07-21 17:56:18,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260779092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:18,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:18,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:56:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391061960] [2022-07-21 17:56:18,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:18,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:56:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:18,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:56:18,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:18,554 INFO L87 Difference]: Start difference. First operand 210 states and 287 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:18,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:18,675 INFO L93 Difference]: Finished difference Result 208 states and 283 transitions. [2022-07-21 17:56:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:56:18,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-07-21 17:56:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:18,677 INFO L225 Difference]: With dead ends: 208 [2022-07-21 17:56:18,677 INFO L226 Difference]: Without dead ends: 208 [2022-07-21 17:56:18,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-21 17:56:18,678 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 84 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:18,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 816 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-21 17:56:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-07-21 17:56:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.3837837837837839) internal successors, (256), 187 states have internal predecessors, (256), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2022-07-21 17:56:18,684 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 39 [2022-07-21 17:56:18,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:18,684 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2022-07-21 17:56:18,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2022-07-21 17:56:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 17:56:18,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:18,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:18,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 17:56:18,686 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:18,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:18,687 INFO L85 PathProgramCache]: Analyzing trace with hash 143802726, now seen corresponding path program 1 times [2022-07-21 17:56:18,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:18,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020852419] [2022-07-21 17:56:18,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:18,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:18,725 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-21 17:56:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:18,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020852419] [2022-07-21 17:56:18,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020852419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:18,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:18,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:56:18,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100313391] [2022-07-21 17:56:18,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:18,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:56:18,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:18,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:56:18,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:56:18,728 INFO L87 Difference]: Start difference. First operand 208 states and 283 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:18,789 INFO L93 Difference]: Finished difference Result 217 states and 292 transitions. [2022-07-21 17:56:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:56:18,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-21 17:56:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:18,791 INFO L225 Difference]: With dead ends: 217 [2022-07-21 17:56:18,791 INFO L226 Difference]: Without dead ends: 186 [2022-07-21 17:56:18,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:56:18,792 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 36 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:18,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1166 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:18,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-21 17:56:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-21 17:56:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 163 states have (on average 1.3742331288343559) internal successors, (224), 165 states have internal predecessors, (224), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 251 transitions. [2022-07-21 17:56:18,797 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 251 transitions. Word has length 37 [2022-07-21 17:56:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:18,798 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 251 transitions. [2022-07-21 17:56:18,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 251 transitions. [2022-07-21 17:56:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:56:18,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:18,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:18,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 17:56:18,799 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:18,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash -233541237, now seen corresponding path program 1 times [2022-07-21 17:56:18,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:18,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197549326] [2022-07-21 17:56:18,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:18,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:18,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 17:56:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:56:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:18,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:56:18,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:18,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197549326] [2022-07-21 17:56:18,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197549326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:18,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:18,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:56:18,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424505907] [2022-07-21 17:56:18,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:18,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:56:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:18,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:56:18,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:56:18,872 INFO L87 Difference]: Start difference. First operand 186 states and 251 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:19,044 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2022-07-21 17:56:19,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:56:19,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-07-21 17:56:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:19,046 INFO L225 Difference]: With dead ends: 211 [2022-07-21 17:56:19,046 INFO L226 Difference]: Without dead ends: 204 [2022-07-21 17:56:19,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:56:19,047 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 58 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:19,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1275 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-21 17:56:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 194. [2022-07-21 17:56:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 172 states have internal predecessors, (232), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (13), 13 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-21 17:56:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2022-07-21 17:56:19,058 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 41 [2022-07-21 17:56:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:19,059 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2022-07-21 17:56:19,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2022-07-21 17:56:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:56:19,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:19,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:19,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 17:56:19,061 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:19,061 INFO L85 PathProgramCache]: Analyzing trace with hash 131822704, now seen corresponding path program 1 times [2022-07-21 17:56:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:19,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598136570] [2022-07-21 17:56:19,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:19,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 17:56:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:56:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,103 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-21 17:56:19,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:19,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598136570] [2022-07-21 17:56:19,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598136570] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:19,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:19,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:56:19,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065989427] [2022-07-21 17:56:19,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:19,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:56:19,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:19,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:56:19,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:19,106 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:19,198 INFO L93 Difference]: Finished difference Result 207 states and 273 transitions. [2022-07-21 17:56:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:56:19,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-07-21 17:56:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:19,200 INFO L225 Difference]: With dead ends: 207 [2022-07-21 17:56:19,200 INFO L226 Difference]: Without dead ends: 205 [2022-07-21 17:56:19,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:56:19,201 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 54 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:19,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 701 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-21 17:56:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2022-07-21 17:56:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 172 states have (on average 1.3546511627906976) internal successors, (233), 174 states have internal predecessors, (233), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (13), 13 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-21 17:56:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 261 transitions. [2022-07-21 17:56:19,206 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 261 transitions. Word has length 42 [2022-07-21 17:56:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:19,206 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 261 transitions. [2022-07-21 17:56:19,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 261 transitions. [2022-07-21 17:56:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:56:19,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:19,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:19,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 17:56:19,208 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1766604753, now seen corresponding path program 1 times [2022-07-21 17:56:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:19,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049711097] [2022-07-21 17:56:19,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 17:56:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:56:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,276 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-21 17:56:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:19,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049711097] [2022-07-21 17:56:19,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049711097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:19,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:19,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:56:19,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336162015] [2022-07-21 17:56:19,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:19,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:56:19,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:19,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:56:19,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:56:19,279 INFO L87 Difference]: Start difference. First operand 196 states and 261 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:19,445 INFO L93 Difference]: Finished difference Result 216 states and 286 transitions. [2022-07-21 17:56:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:56:19,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-21 17:56:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:19,447 INFO L225 Difference]: With dead ends: 216 [2022-07-21 17:56:19,447 INFO L226 Difference]: Without dead ends: 216 [2022-07-21 17:56:19,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:56:19,450 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 119 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:19,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1283 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-21 17:56:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2022-07-21 17:56:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 175 states have internal predecessors, (234), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (13), 13 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-21 17:56:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 262 transitions. [2022-07-21 17:56:19,458 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 262 transitions. Word has length 43 [2022-07-21 17:56:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:19,458 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 262 transitions. [2022-07-21 17:56:19,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 262 transitions. [2022-07-21 17:56:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:56:19,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:19,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:19,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 17:56:19,460 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:19,460 INFO L85 PathProgramCache]: Analyzing trace with hash -446330305, now seen corresponding path program 1 times [2022-07-21 17:56:19,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:19,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172008316] [2022-07-21 17:56:19,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:19,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 17:56:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:56:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,525 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-21 17:56:19,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:19,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172008316] [2022-07-21 17:56:19,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172008316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:19,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:19,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:56:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309575425] [2022-07-21 17:56:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:19,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:56:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:19,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:56:19,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:19,527 INFO L87 Difference]: Start difference. First operand 197 states and 262 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:19,614 INFO L93 Difference]: Finished difference Result 194 states and 255 transitions. [2022-07-21 17:56:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:56:19,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-21 17:56:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:19,616 INFO L225 Difference]: With dead ends: 194 [2022-07-21 17:56:19,616 INFO L226 Difference]: Without dead ends: 186 [2022-07-21 17:56:19,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:56:19,617 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 67 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:19,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 680 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:19,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-21 17:56:19,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2022-07-21 17:56:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 162 states have (on average 1.3580246913580247) internal successors, (220), 163 states have internal predecessors, (220), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 246 transitions. [2022-07-21 17:56:19,623 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 246 transitions. Word has length 43 [2022-07-21 17:56:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:19,624 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 246 transitions. [2022-07-21 17:56:19,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 246 transitions. [2022-07-21 17:56:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:56:19,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:19,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:19,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 17:56:19,626 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:19,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash 694033782, now seen corresponding path program 1 times [2022-07-21 17:56:19,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:19,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837850298] [2022-07-21 17:56:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 17:56:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:56:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,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-21 17:56:19,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:19,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837850298] [2022-07-21 17:56:19,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837850298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:19,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:19,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:56:19,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924150684] [2022-07-21 17:56:19,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:19,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:56:19,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:19,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:56:19,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:56:19,721 INFO L87 Difference]: Start difference. First operand 184 states and 246 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:19,795 INFO L93 Difference]: Finished difference Result 178 states and 237 transitions. [2022-07-21 17:56:19,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:56:19,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-07-21 17:56:19,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:19,796 INFO L225 Difference]: With dead ends: 178 [2022-07-21 17:56:19,796 INFO L226 Difference]: Without dead ends: 178 [2022-07-21 17:56:19,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:56:19,797 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 79 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:19,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 980 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:19,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-21 17:56:19,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-21 17:56:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 156 states have (on average 1.3525641025641026) internal successors, (211), 157 states have internal predecessors, (211), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 237 transitions. [2022-07-21 17:56:19,803 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 237 transitions. Word has length 44 [2022-07-21 17:56:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:19,803 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 237 transitions. [2022-07-21 17:56:19,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 237 transitions. [2022-07-21 17:56:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:56:19,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:19,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:19,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 17:56:19,804 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:19,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:19,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1239862159, now seen corresponding path program 1 times [2022-07-21 17:56:19,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:19,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162984433] [2022-07-21 17:56:19,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:19,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 17:56:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:19,875 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-21 17:56:19,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:19,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162984433] [2022-07-21 17:56:19,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162984433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:19,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:19,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:56:19,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424836072] [2022-07-21 17:56:19,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:19,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:56:19,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:19,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:56:19,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:56:19,878 INFO L87 Difference]: Start difference. First operand 178 states and 237 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:20,022 INFO L93 Difference]: Finished difference Result 176 states and 232 transitions. [2022-07-21 17:56:20,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:56:20,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-07-21 17:56:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:20,024 INFO L225 Difference]: With dead ends: 176 [2022-07-21 17:56:20,024 INFO L226 Difference]: Without dead ends: 176 [2022-07-21 17:56:20,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:56:20,025 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 239 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:20,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 809 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-21 17:56:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2022-07-21 17:56:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 153 states have internal predecessors, (204), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 230 transitions. [2022-07-21 17:56:20,031 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 230 transitions. Word has length 42 [2022-07-21 17:56:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:20,031 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 230 transitions. [2022-07-21 17:56:20,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 230 transitions. [2022-07-21 17:56:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:56:20,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:20,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:20,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 17:56:20,033 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:20,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1096582801, now seen corresponding path program 1 times [2022-07-21 17:56:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:20,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906270626] [2022-07-21 17:56:20,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:20,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:20,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 17:56:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:20,106 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-21 17:56:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:20,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906270626] [2022-07-21 17:56:20,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906270626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:20,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:20,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:56:20,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369606871] [2022-07-21 17:56:20,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:20,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:56:20,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:20,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:56:20,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:56:20,108 INFO L87 Difference]: Start difference. First operand 174 states and 230 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:20,258 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2022-07-21 17:56:20,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:56:20,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-07-21 17:56:20,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:20,260 INFO L225 Difference]: With dead ends: 185 [2022-07-21 17:56:20,260 INFO L226 Difference]: Without dead ends: 169 [2022-07-21 17:56:20,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:56:20,261 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 52 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:20,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1409 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-21 17:56:20,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-21 17:56:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 148 states have (on average 1.3445945945945945) internal successors, (199), 149 states have internal predecessors, (199), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-21 17:56:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 223 transitions. [2022-07-21 17:56:20,266 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 223 transitions. Word has length 42 [2022-07-21 17:56:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:20,267 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 223 transitions. [2022-07-21 17:56:20,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 223 transitions. [2022-07-21 17:56:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 17:56:20,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:20,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:56:20,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 17:56:20,268 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1105542194, now seen corresponding path program 1 times [2022-07-21 17:56:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:20,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640101474] [2022-07-21 17:56:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:20,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 17:56:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:20,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 17:56:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:20,312 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-21 17:56:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:20,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640101474] [2022-07-21 17:56:20,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640101474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:20,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:20,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:56:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338088022] [2022-07-21 17:56:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:20,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:56:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:56:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:56:20,314 INFO L87 Difference]: Start difference. First operand 169 states and 223 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:56:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:20,371 INFO L93 Difference]: Finished difference Result 170 states and 223 transitions. [2022-07-21 17:56:20,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:56:20,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-07-21 17:56:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:20,372 INFO L225 Difference]: With dead ends: 170 [2022-07-21 17:56:20,372 INFO L226 Difference]: Without dead ends: 168 [2022-07-21 17:56:20,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:56:20,374 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 26 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:20,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 531 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:20,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-21 17:56:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-21 17:56:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 148 states have internal predecessors, (194), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-21 17:56:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 218 transitions. [2022-07-21 17:56:20,382 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 218 transitions. Word has length 48 [2022-07-21 17:56:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:20,383 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 218 transitions. [2022-07-21 17:56:20,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:56:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 218 transitions. [2022-07-21 17:56:20,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:56:20,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:20,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:56:20,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 17:56:20,385 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:20,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash 364909914, now seen corresponding path program 1 times [2022-07-21 17:56:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:20,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595367284] [2022-07-21 17:56:20,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:20,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:56:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 17:56:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:20,478 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-21 17:56:20,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:20,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595367284] [2022-07-21 17:56:20,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595367284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:20,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:20,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:56:20,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483409419] [2022-07-21 17:56:20,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:20,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:56:20,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:20,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:56:20,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:56:20,481 INFO L87 Difference]: Start difference. First operand 168 states and 218 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:20,656 INFO L93 Difference]: Finished difference Result 177 states and 227 transitions. [2022-07-21 17:56:20,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:56:20,657 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-21 17:56:20,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:20,657 INFO L225 Difference]: With dead ends: 177 [2022-07-21 17:56:20,658 INFO L226 Difference]: Without dead ends: 145 [2022-07-21 17:56:20,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:56:20,658 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 41 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:20,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1539 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-21 17:56:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-07-21 17:56:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.288) internal successors, (161), 126 states have internal predecessors, (161), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-21 17:56:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 183 transitions. [2022-07-21 17:56:20,664 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 183 transitions. Word has length 49 [2022-07-21 17:56:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:20,665 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 183 transitions. [2022-07-21 17:56:20,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions. [2022-07-21 17:56:20,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:56:20,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:20,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:20,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 17:56:20,666 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1292109318, now seen corresponding path program 1 times [2022-07-21 17:56:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:20,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613702627] [2022-07-21 17:56:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:20,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:56:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:20,748 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-21 17:56:20,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:20,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613702627] [2022-07-21 17:56:20,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613702627] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:20,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:20,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:56:20,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157806332] [2022-07-21 17:56:20,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:20,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:56:20,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:20,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:56:20,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:56:20,750 INFO L87 Difference]: Start difference. First operand 145 states and 183 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:20,965 INFO L93 Difference]: Finished difference Result 192 states and 234 transitions. [2022-07-21 17:56:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:56:20,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-07-21 17:56:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:20,967 INFO L225 Difference]: With dead ends: 192 [2022-07-21 17:56:20,967 INFO L226 Difference]: Without dead ends: 180 [2022-07-21 17:56:20,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:56:20,968 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 323 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:20,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 702 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:56:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-21 17:56:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2022-07-21 17:56:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.2769230769230768) internal successors, (166), 132 states have internal predecessors, (166), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:56:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 190 transitions. [2022-07-21 17:56:20,972 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 190 transitions. Word has length 43 [2022-07-21 17:56:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:20,973 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 190 transitions. [2022-07-21 17:56:20,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 190 transitions. [2022-07-21 17:56:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:56:20,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:20,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:20,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 17:56:20,974 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:20,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:20,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1608018874, now seen corresponding path program 1 times [2022-07-21 17:56:20,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:20,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509159337] [2022-07-21 17:56:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:20,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:21,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:56:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:21,044 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-21 17:56:21,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:56:21,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509159337] [2022-07-21 17:56:21,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509159337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:21,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:21,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:56:21,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568346998] [2022-07-21 17:56:21,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:21,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:56:21,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:56:21,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:56:21,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:56:21,047 INFO L87 Difference]: Start difference. First operand 151 states and 190 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:21,197 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2022-07-21 17:56:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:56:21,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-07-21 17:56:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:21,198 INFO L225 Difference]: With dead ends: 162 [2022-07-21 17:56:21,198 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 17:56:21,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:56:21,199 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 52 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:21,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1045 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 17:56:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-21 17:56:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 109 states have (on average 1.1559633027522935) internal successors, (126), 111 states have internal predecessors, (126), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-21 17:56:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2022-07-21 17:56:21,202 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 43 [2022-07-21 17:56:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:21,202 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2022-07-21 17:56:21,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2022-07-21 17:56:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:56:21,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:21,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:21,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 17:56:21,204 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:21,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:21,205 INFO L85 PathProgramCache]: Analyzing trace with hash -825515977, now seen corresponding path program 1 times [2022-07-21 17:56:21,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:56:21,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105750378] [2022-07-21 17:56:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:56:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 17:56:21,218 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 17:56:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 17:56:21,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 17:56:21,260 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 17:56:21,261 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-21 17:56:21,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-21 17:56:21,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 17:56:21,266 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:21,271 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 17:56:21,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:56:21 BoogieIcfgContainer [2022-07-21 17:56:21,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 17:56:21,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 17:56:21,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 17:56:21,360 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 17:56:21,361 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:56:16" (3/4) ... [2022-07-21 17:56:21,363 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 17:56:21,363 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 17:56:21,367 INFO L158 Benchmark]: Toolchain (without parser) took 6627.92ms. Allocated memory was 54.5MB in the beginning and 121.6MB in the end (delta: 67.1MB). Free memory was 31.3MB in the beginning and 66.0MB in the end (delta: -34.7MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2022-07-21 17:56:21,367 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 54.5MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:56:21,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.26ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.1MB in the beginning and 45.3MB in the end (delta: -14.2MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-07-21 17:56:21,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.54ms. Allocated memory is still 69.2MB. Free memory was 45.3MB in the beginning and 41.5MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:56:21,368 INFO L158 Benchmark]: Boogie Preprocessor took 41.32ms. Allocated memory is still 69.2MB. Free memory was 41.5MB in the beginning and 39.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 17:56:21,369 INFO L158 Benchmark]: RCFGBuilder took 794.64ms. Allocated memory is still 69.2MB. Free memory was 39.0MB in the beginning and 42.2MB in the end (delta: -3.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-07-21 17:56:21,369 INFO L158 Benchmark]: TraceAbstraction took 5190.14ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 41.5MB in the beginning and 66.0MB in the end (delta: -24.5MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2022-07-21 17:56:21,370 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 121.6MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:56:21,376 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 54.5MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.26ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.1MB in the beginning and 45.3MB in the end (delta: -14.2MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.54ms. Allocated memory is still 69.2MB. Free memory was 45.3MB in the beginning and 41.5MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.32ms. Allocated memory is still 69.2MB. Free memory was 41.5MB in the beginning and 39.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 794.64ms. Allocated memory is still 69.2MB. Free memory was 39.0MB in the beginning and 42.2MB in the end (delta: -3.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5190.14ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 41.5MB in the beginning and 66.0MB in the end (delta: -24.5MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 121.6MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1013]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1013. Possible FailurePath: [L23] int KernelMode ; [L24] int Executive ; [L25] int DevicePowerState ; [L26] int s ; [L27] int UNLOADED ; [L28] int NP ; [L29] int DC ; [L30] int SKIP1 ; [L31] int SKIP2 ; [L32] int MPR1 ; [L33] int MPR3 ; [L34] int IPC ; [L35] int pended ; [L36] int compFptr ; [L37] int compRegistered ; [L38] int lowerDriverReturn ; [L39] int setEventCalled ; [L40] int customIrp ; [L41] int myStatus ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L294] int status ; [L295] int irp = __VERIFIER_nondet_int() ; [L296] int pirp ; [L297] int pirp__IoStatus__Status ; [L298] int irp_choice = __VERIFIER_nondet_int() ; [L299] int devobj = __VERIFIER_nondet_int() ; [L300] int __cil_tmp8 ; [L302] KernelMode = 0 [L303] Executive = 0 [L304] DevicePowerState = 1 [L305] s = 0 [L306] UNLOADED = 0 [L307] NP = 0 [L308] DC = 0 [L309] SKIP1 = 0 [L310] SKIP2 = 0 [L311] MPR1 = 0 [L312] MPR3 = 0 [L313] IPC = 0 [L314] pended = 0 [L315] compFptr = 0 [L316] compRegistered = 0 [L317] lowerDriverReturn = 0 [L318] setEventCalled = 0 [L319] customIrp = 0 [L320] myStatus = 0 [L324] status = 0 [L325] pirp = irp [L326] CALL _BLAST_init() [L61] UNLOADED = 0 [L62] NP = 1 [L63] DC = 2 [L64] SKIP1 = 3 [L65] SKIP2 = 4 [L66] MPR1 = 5 [L67] MPR3 = 6 [L68] IPC = 7 [L69] s = UNLOADED [L70] pended = 0 [L71] compFptr = 0 [L72] compRegistered = 0 [L73] lowerDriverReturn = 0 [L74] setEventCalled = 0 [L75] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L326] RET _BLAST_init() [L328] COND TRUE status >= 0 [L329] s = NP [L330] customIrp = 0 [L331] setEventCalled = customIrp [L332] lowerDriverReturn = setEventCalled [L333] compRegistered = lowerDriverReturn [L334] pended = compRegistered [L335] pirp__IoStatus__Status = 0 [L336] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L337] COND TRUE irp_choice == 0 [L338] pirp__IoStatus__Status = -1073741637 [L339] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L342] CALL stub_driver_init() [L47] s = NP [L48] pended = 0 [L49] compFptr = 0 [L50] compRegistered = 0 [L51] lowerDriverReturn = 0 [L52] setEventCalled = 0 [L53] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L342] RET stub_driver_init() [L345] COND FALSE !(status < 0) [L349] int tmp_ndt_1; [L350] tmp_ndt_1 = __VERIFIER_nondet_int() [L351] COND FALSE !(tmp_ndt_1 == 0) [L354] int tmp_ndt_2; [L355] tmp_ndt_2 = __VERIFIER_nondet_int() [L356] COND FALSE !(tmp_ndt_2 == 1) [L359] int tmp_ndt_3; [L360] tmp_ndt_3 = __VERIFIER_nondet_int() [L361] COND TRUE tmp_ndt_3 == 3 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L388] CALL, EXPR KbFilter_PnP(devobj, pirp) [L80] int devExt ; [L81] int irpStack ; [L82] int status ; [L83] int event = __VERIFIER_nondet_int() ; [L84] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L85] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L86] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L87] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L88] int devExt__Started ; [L89] int devExt__Removed ; [L90] int devExt__SurpriseRemoved ; [L91] int Irp__IoStatus__Status ; [L92] int Irp__IoStatus__Information ; [L93] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L94] int irpSp ; [L95] int nextIrpSp ; [L96] int nextIrpSp__Control ; [L97] int irpSp___0 ; [L98] int irpSp__Context ; [L99] int irpSp__Control ; [L100] long __cil_tmp23 ; [L103] status = 0 [L104] devExt = DeviceObject__DeviceExtension [L105] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=-1, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L106] COND FALSE !(irpStack__MinorFunction == 0) VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=-1, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L109] COND FALSE !(irpStack__MinorFunction == 23) VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=-1, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L112] COND TRUE irpStack__MinorFunction == 2 VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=-1, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L236] devExt__Removed = 1 VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=-1, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L237] COND TRUE s == NP [L238] s = SKIP1 VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=-1, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L245] Irp__CurrentLocation ++ [L246] Irp__Tail__Overlay__CurrentStackLocation ++ VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L247] CALL IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L483] int returnVal2 ; [L484] int compRetStatus ; [L485] int lcontext = __VERIFIER_nondet_int() ; [L486] long long __cil_tmp7 ; VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L489] COND FALSE !(\read(compRegistered)) VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L502] int tmp_ndt_6; [L503] tmp_ndt_6 = __VERIFIER_nondet_int() [L504] COND FALSE !(tmp_ndt_6 == 0) [L507] int tmp_ndt_7; [L508] tmp_ndt_7 = __VERIFIER_nondet_int() [L509] COND TRUE tmp_ndt_7 == 1 VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L518] returnVal2 = -1073741823 VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L528] COND FALSE !(s == NP) VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L532] COND FALSE !(s == MPR1) VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L541] COND TRUE s == SKIP1 [L542] s = SKIP2 [L543] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L551] return (returnVal2); VAL [\old(DeviceObject)=0, \old(Irp)=-3, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, \result=-1073741823, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-3, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L247] RET IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IofCallDriver(devExt__TopOfStack, Irp)=-1073741823, IPC=7, Irp=-3, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L248] status = 0 VAL [\old(DeviceObject)=-2, \old(Irp)=-3, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L290] return (status); VAL [\old(DeviceObject)=-2, \old(Irp)=-3, \result=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=-2, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-3, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L388] RET, EXPR KbFilter_PnP(devobj, pirp) [L388] status = KbFilter_PnP(devobj, pirp) [L412] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L420] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L428] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L429] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L430] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L440] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L447] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L452] COND TRUE status != lowerDriverReturn VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=-2, Executive=0, IPC=7, irp=-3, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-3, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-4, tmp_ndt_3=3, UNLOADED=0] [L453] CALL errorFn() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1013] reach_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - UnprovableResult [Line: 293]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 210 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3672 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3636 mSDsluCounter, 18051 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12608 mSDsCounter, 503 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2789 IncrementalHoareTripleChecker+Invalid, 3292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 503 mSolverCounterUnsat, 5443 mSDtfsCounter, 2789 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=6, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 179 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 859 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 792 ConstructedInterpolants, 0 QuantifiedInterpolants, 1966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-21 17:56:21,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a05fbc1d8a2048d37fda072c6a9d42f1f996d033c914869a4e2960aadff82dde --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:56:23,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:56:23,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:56:23,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:56:23,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:56:23,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:56:23,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:56:23,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:56:23,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:56:23,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:56:23,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:56:23,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:56:23,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:56:23,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:56:23,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:56:23,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:56:23,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:56:23,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:56:23,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:56:23,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:56:23,352 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:56:23,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:56:23,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:56:23,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:56:23,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:56:23,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:56:23,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:56:23,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:56:23,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:56:23,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:56:23,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:56:23,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:56:23,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:56:23,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:56:23,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:56:23,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:56:23,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:56:23,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:56:23,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:56:23,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:56:23,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:56:23,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:56:23,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-21 17:56:23,411 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:56:23,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:56:23,412 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:56:23,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:56:23,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:56:23,413 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:56:23,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:56:23,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:56:23,414 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:56:23,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:56:23,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:56:23,415 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:56:23,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:56:23,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:56:23,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:56:23,423 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:56:23,423 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:56:23,423 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:56:23,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:56:23,424 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:56:23,424 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 17:56:23,424 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 17:56:23,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:56:23,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:56:23,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:56:23,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:56:23,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:56:23,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:56:23,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:56:23,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:56:23,426 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 17:56:23,426 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 17:56:23,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 17:56:23,426 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a05fbc1d8a2048d37fda072c6a9d42f1f996d033c914869a4e2960aadff82dde [2022-07-21 17:56:23,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:56:23,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:56:23,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:56:23,767 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:56:23,767 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:56:23,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-07-21 17:56:23,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d280e9957/f1c835b5c13e41938ae5296e9eeb0f46/FLAG5d3f7f5ab [2022-07-21 17:56:24,327 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:56:24,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-07-21 17:56:24,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d280e9957/f1c835b5c13e41938ae5296e9eeb0f46/FLAG5d3f7f5ab [2022-07-21 17:56:24,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d280e9957/f1c835b5c13e41938ae5296e9eeb0f46 [2022-07-21 17:56:24,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:56:24,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:56:24,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:56:24,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:56:24,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:56:24,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:56:24" (1/1) ... [2022-07-21 17:56:24,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe08569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:24, skipping insertion in model container [2022-07-21 17:56:24,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:56:24" (1/1) ... [2022-07-21 17:56:24,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:56:24,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:56:25,003 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/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2022-07-21 17:56:25,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:56:25,014 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:56:25,069 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/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2022-07-21 17:56:25,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:56:25,089 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:56:25,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:25 WrapperNode [2022-07-21 17:56:25,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:56:25,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:56:25,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:56:25,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:56:25,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:25" (1/1) ... [2022-07-21 17:56:25,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:25" (1/1) ... [2022-07-21 17:56:25,147 INFO L137 Inliner]: procedures = 29, calls = 44, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 607 [2022-07-21 17:56:25,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:56:25,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:56:25,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:56:25,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:56:25,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:25" (1/1) ... [2022-07-21 17:56:25,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:25" (1/1) ... [2022-07-21 17:56:25,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:25" (1/1) ... [2022-07-21 17:56:25,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:25" (1/1) ... [2022-07-21 17:56:25,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:25" (1/1) ... [2022-07-21 17:56:25,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:25" (1/1) ... [2022-07-21 17:56:25,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:25" (1/1) ... [2022-07-21 17:56:25,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:56:25,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:56:25,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:56:25,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:56:25,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:25" (1/1) ... [2022-07-21 17:56:25,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:56:25,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:56:25,218 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-21 17:56:25,223 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-21 17:56:25,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:56:25,251 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-21 17:56:25,251 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-21 17:56:25,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 17:56:25,252 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-21 17:56:25,252 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-21 17:56:25,252 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-21 17:56:25,254 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-21 17:56:25,254 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-21 17:56:25,254 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-21 17:56:25,254 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-21 17:56:25,254 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-21 17:56:25,255 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-21 17:56:25,255 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-21 17:56:25,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:56:25,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:56:25,255 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-21 17:56:25,255 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-21 17:56:25,413 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:56:25,415 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:56:25,569 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 17:56:25,582 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 17:56:25,585 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 17:56:25,593 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 17:56:25,597 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 17:56:26,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-07-21 17:56:26,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-07-21 17:56:26,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-07-21 17:56:26,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-07-21 17:56:26,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-07-21 17:56:26,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-07-21 17:56:26,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-21 17:56:26,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-21 17:56:26,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-07-21 17:56:26,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-07-21 17:56:26,026 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 17:56:26,059 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-21 17:56:26,060 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-21 17:56:26,069 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:56:26,092 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:56:26,092 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 17:56:26,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:56:26 BoogieIcfgContainer [2022-07-21 17:56:26,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:56:26,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:56:26,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:56:26,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:56:26,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:56:24" (1/3) ... [2022-07-21 17:56:26,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6083631b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:56:26, skipping insertion in model container [2022-07-21 17:56:26,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:25" (2/3) ... [2022-07-21 17:56:26,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6083631b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:56:26, skipping insertion in model container [2022-07-21 17:56:26,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:56:26" (3/3) ... [2022-07-21 17:56:26,103 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2022-07-21 17:56:26,118 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:56:26,118 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 17:56:26,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:56:26,176 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@6c98ca60, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@df3a3c4 [2022-07-21 17:56:26,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-21 17:56:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 171 states have (on average 1.6023391812865497) internal successors, (274), 190 states have internal predecessors, (274), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-21 17:56:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 17:56:26,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:26,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:26,188 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:26,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:26,193 INFO L85 PathProgramCache]: Analyzing trace with hash -15799092, now seen corresponding path program 1 times [2022-07-21 17:56:26,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:26,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974745292] [2022-07-21 17:56:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:26,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:26,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:26,211 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:26,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 17:56:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:26,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 17:56:26,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:26,360 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-21 17:56:26,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:26,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:26,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974745292] [2022-07-21 17:56:26,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974745292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:26,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:26,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:56:26,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041143958] [2022-07-21 17:56:26,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:26,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:26,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:26,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:26,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:26,407 INFO L87 Difference]: Start difference. First operand has 210 states, 171 states have (on average 1.6023391812865497) internal successors, (274), 190 states have internal predecessors, (274), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:26,488 INFO L93 Difference]: Finished difference Result 212 states and 315 transitions. [2022-07-21 17:56:26,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:26,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-21 17:56:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:26,499 INFO L225 Difference]: With dead ends: 212 [2022-07-21 17:56:26,500 INFO L226 Difference]: Without dead ends: 208 [2022-07-21 17:56:26,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-21 17:56:26,504 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 179 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:26,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 419 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-21 17:56:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-07-21 17:56:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 169 states have (on average 1.5739644970414202) internal successors, (266), 186 states have internal predecessors, (266), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-21 17:56:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2022-07-21 17:56:26,563 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 8 [2022-07-21 17:56:26,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:26,563 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2022-07-21 17:56:26,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2022-07-21 17:56:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 17:56:26,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:26,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:26,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:26,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:26,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:26,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:26,776 INFO L85 PathProgramCache]: Analyzing trace with hash -191249986, now seen corresponding path program 1 times [2022-07-21 17:56:26,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:26,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763769394] [2022-07-21 17:56:26,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:26,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:26,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:26,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:26,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 17:56:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:26,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 17:56:26,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:26,889 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-21 17:56:26,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:26,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:26,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763769394] [2022-07-21 17:56:26,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763769394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:26,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:26,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:56:26,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671194837] [2022-07-21 17:56:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:26,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:26,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:26,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:26,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:26,892 INFO L87 Difference]: Start difference. First operand 206 states and 310 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:26,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:26,932 INFO L93 Difference]: Finished difference Result 205 states and 309 transitions. [2022-07-21 17:56:26,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:26,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-21 17:56:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:26,934 INFO L225 Difference]: With dead ends: 205 [2022-07-21 17:56:26,935 INFO L226 Difference]: Without dead ends: 201 [2022-07-21 17:56:26,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-21 17:56:26,936 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 199 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:26,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 373 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-21 17:56:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-21 17:56:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 165 states have (on average 1.5272727272727273) internal successors, (252), 181 states have internal predecessors, (252), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-21 17:56:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2022-07-21 17:56:26,958 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 15 [2022-07-21 17:56:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:26,958 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2022-07-21 17:56:26,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2022-07-21 17:56:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 17:56:26,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:26,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:26,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:27,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:27,169 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:27,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:27,170 INFO L85 PathProgramCache]: Analyzing trace with hash 509601447, now seen corresponding path program 1 times [2022-07-21 17:56:27,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:27,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780154357] [2022-07-21 17:56:27,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:27,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:27,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:27,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:27,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 17:56:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:27,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:56:27,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:27,412 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-21 17:56:27,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:27,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:27,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780154357] [2022-07-21 17:56:27,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780154357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:27,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:27,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:56:27,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725926330] [2022-07-21 17:56:27,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:27,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:56:27,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:27,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:56:27,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:56:27,415 INFO L87 Difference]: Start difference. First operand 201 states and 296 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 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-21 17:56:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:27,620 INFO L93 Difference]: Finished difference Result 269 states and 381 transitions. [2022-07-21 17:56:27,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:56:27,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 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 19 [2022-07-21 17:56:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:27,625 INFO L225 Difference]: With dead ends: 269 [2022-07-21 17:56:27,626 INFO L226 Difference]: Without dead ends: 268 [2022-07-21 17:56:27,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:56:27,630 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 360 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:27,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 393 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:56:27,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-21 17:56:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2022-07-21 17:56:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 215 states have (on average 1.4325581395348836) internal successors, (308), 218 states have internal predecessors, (308), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2022-07-21 17:56:27,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2022-07-21 17:56:27,658 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 19 [2022-07-21 17:56:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:27,658 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2022-07-21 17:56:27,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 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-21 17:56:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2022-07-21 17:56:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 17:56:27,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:27,660 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-21 17:56:27,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:27,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:27,869 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043468, now seen corresponding path program 1 times [2022-07-21 17:56:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:27,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547977209] [2022-07-21 17:56:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:27,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:27,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:27,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:27,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 17:56:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:27,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 17:56:27,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:56:27,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:27,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:27,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547977209] [2022-07-21 17:56:27,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547977209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:27,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:27,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:56:27,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267317150] [2022-07-21 17:56:27,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:27,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:27,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:27,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:27,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:27,978 INFO L87 Difference]: Start difference. First operand 252 states and 361 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:28,001 INFO L93 Difference]: Finished difference Result 312 states and 436 transitions. [2022-07-21 17:56:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:28,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 17:56:28,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:28,006 INFO L225 Difference]: With dead ends: 312 [2022-07-21 17:56:28,006 INFO L226 Difference]: Without dead ends: 312 [2022-07-21 17:56:28,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-21 17:56:28,013 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 242 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:28,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 360 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-21 17:56:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 290. [2022-07-21 17:56:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 255 states have (on average 1.419607843137255) internal successors, (362), 256 states have internal predecessors, (362), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-21 17:56:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2022-07-21 17:56:28,054 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 18 [2022-07-21 17:56:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:28,054 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2022-07-21 17:56:28,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2022-07-21 17:56:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 17:56:28,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:28,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:28,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:28,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:28,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:28,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1363549369, now seen corresponding path program 1 times [2022-07-21 17:56:28,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:28,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135815423] [2022-07-21 17:56:28,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:28,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:28,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:28,274 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:28,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 17:56:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:28,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:56:28,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:28,464 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-21 17:56:28,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:28,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:28,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135815423] [2022-07-21 17:56:28,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135815423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:28,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:28,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:56:28,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368824330] [2022-07-21 17:56:28,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:28,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:56:28,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:28,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:56:28,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:56:28,467 INFO L87 Difference]: Start difference. First operand 290 states and 410 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:28,594 INFO L93 Difference]: Finished difference Result 289 states and 407 transitions. [2022-07-21 17:56:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:56:28,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-21 17:56:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:28,597 INFO L225 Difference]: With dead ends: 289 [2022-07-21 17:56:28,597 INFO L226 Difference]: Without dead ends: 289 [2022-07-21 17:56:28,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:56:28,598 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 278 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:28,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 443 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-21 17:56:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-21 17:56:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 255 states have (on average 1.411764705882353) internal successors, (360), 255 states have internal predecessors, (360), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-21 17:56:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2022-07-21 17:56:28,608 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 29 [2022-07-21 17:56:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:28,608 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2022-07-21 17:56:28,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2022-07-21 17:56:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 17:56:28,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:28,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:28,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:28,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:28,820 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1270637010, now seen corresponding path program 1 times [2022-07-21 17:56:28,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:28,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487391221] [2022-07-21 17:56:28,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:28,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:28,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:28,823 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:28,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 17:56:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:28,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:56:28,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:29,034 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-21 17:56:29,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:29,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:29,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487391221] [2022-07-21 17:56:29,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487391221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:29,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:29,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:56:29,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749424023] [2022-07-21 17:56:29,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:29,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:56:29,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:29,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:56:29,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:29,037 INFO L87 Difference]: Start difference. First operand 289 states and 407 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:29,201 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2022-07-21 17:56:29,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:56:29,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-21 17:56:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:29,203 INFO L225 Difference]: With dead ends: 307 [2022-07-21 17:56:29,203 INFO L226 Difference]: Without dead ends: 306 [2022-07-21 17:56:29,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:29,204 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 271 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:29,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 653 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:56:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-21 17:56:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-21 17:56:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 267 states have (on average 1.404494382022472) internal successors, (375), 266 states have internal predecessors, (375), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-21 17:56:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2022-07-21 17:56:29,214 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 33 [2022-07-21 17:56:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:29,214 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2022-07-21 17:56:29,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2022-07-21 17:56:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 17:56:29,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:29,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:29,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:29,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:29,425 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:29,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:29,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1113906492, now seen corresponding path program 1 times [2022-07-21 17:56:29,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:29,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723079388] [2022-07-21 17:56:29,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:29,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:29,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:29,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:29,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 17:56:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:29,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:56:29,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:29,628 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-21 17:56:29,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:29,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:29,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723079388] [2022-07-21 17:56:29,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723079388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:29,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:29,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:56:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377175643] [2022-07-21 17:56:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:29,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:56:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:29,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:56:29,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:29,636 INFO L87 Difference]: Start difference. First operand 301 states and 422 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:29,790 INFO L93 Difference]: Finished difference Result 306 states and 425 transitions. [2022-07-21 17:56:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:56:29,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-21 17:56:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:29,792 INFO L225 Difference]: With dead ends: 306 [2022-07-21 17:56:29,792 INFO L226 Difference]: Without dead ends: 306 [2022-07-21 17:56:29,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:29,793 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 269 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:29,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 653 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-21 17:56:29,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-21 17:56:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 267 states have (on average 1.400749063670412) internal successors, (374), 266 states have internal predecessors, (374), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-21 17:56:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 421 transitions. [2022-07-21 17:56:29,800 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 421 transitions. Word has length 34 [2022-07-21 17:56:29,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:29,801 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-21 17:56:29,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:29,801 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 421 transitions. [2022-07-21 17:56:29,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 17:56:29,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:29,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:29,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:30,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:30,010 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:30,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:30,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2136327390, now seen corresponding path program 1 times [2022-07-21 17:56:30,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:30,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037526684] [2022-07-21 17:56:30,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:30,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:30,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:30,013 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:30,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 17:56:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:30,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 17:56:30,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:30,098 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-21 17:56:30,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:30,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:30,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037526684] [2022-07-21 17:56:30,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037526684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:30,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:30,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:56:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153488544] [2022-07-21 17:56:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:30,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:30,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:30,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:30,100 INFO L87 Difference]: Start difference. First operand 301 states and 421 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:30,114 INFO L93 Difference]: Finished difference Result 282 states and 385 transitions. [2022-07-21 17:56:30,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:30,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-21 17:56:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:30,116 INFO L225 Difference]: With dead ends: 282 [2022-07-21 17:56:30,116 INFO L226 Difference]: Without dead ends: 282 [2022-07-21 17:56:30,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-21 17:56:30,117 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 80 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:30,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 524 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-21 17:56:30,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2022-07-21 17:56:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 236 states have (on average 1.3898305084745763) internal successors, (328), 235 states have internal predecessors, (328), 19 states have call successors, (19), 10 states have call predecessors, (19), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-21 17:56:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-07-21 17:56:30,124 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 34 [2022-07-21 17:56:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:30,124 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-07-21 17:56:30,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-07-21 17:56:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 17:56:30,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:30,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:30,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:30,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:30,335 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817048, now seen corresponding path program 1 times [2022-07-21 17:56:30,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:30,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396807046] [2022-07-21 17:56:30,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:30,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:30,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:30,337 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:30,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 17:56:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:30,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:56:30,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:30,518 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-21 17:56:30,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:30,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:30,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396807046] [2022-07-21 17:56:30,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396807046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:30,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:30,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:56:30,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911692029] [2022-07-21 17:56:30,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:30,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:56:30,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:30,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:56:30,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:56:30,521 INFO L87 Difference]: Start difference. First operand 268 states and 370 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:30,643 INFO L93 Difference]: Finished difference Result 268 states and 368 transitions. [2022-07-21 17:56:30,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:56:30,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-21 17:56:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:30,646 INFO L225 Difference]: With dead ends: 268 [2022-07-21 17:56:30,646 INFO L226 Difference]: Without dead ends: 268 [2022-07-21 17:56:30,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:30,646 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 285 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:30,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 421 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-21 17:56:30,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-07-21 17:56:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 236 states have (on average 1.38135593220339) internal successors, (326), 235 states have internal predecessors, (326), 19 states have call successors, (19), 10 states have call predecessors, (19), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-21 17:56:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 368 transitions. [2022-07-21 17:56:30,656 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 368 transitions. Word has length 34 [2022-07-21 17:56:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:30,657 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 368 transitions. [2022-07-21 17:56:30,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 368 transitions. [2022-07-21 17:56:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 17:56:30,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:30,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:30,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:30,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:30,858 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:30,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:30,859 INFO L85 PathProgramCache]: Analyzing trace with hash -382146908, now seen corresponding path program 1 times [2022-07-21 17:56:30,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:30,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940883643] [2022-07-21 17:56:30,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:30,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:30,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:30,862 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:30,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 17:56:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:30,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 17:56:30,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:30,987 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-21 17:56:30,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:30,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:30,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940883643] [2022-07-21 17:56:30,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940883643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:30,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:30,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:56:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530774688] [2022-07-21 17:56:30,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:30,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:30,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:30,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:30,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:30,989 INFO L87 Difference]: Start difference. First operand 268 states and 368 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:31,003 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2022-07-21 17:56:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:31,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-21 17:56:31,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:31,005 INFO L225 Difference]: With dead ends: 262 [2022-07-21 17:56:31,005 INFO L226 Difference]: Without dead ends: 232 [2022-07-21 17:56:31,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-21 17:56:31,006 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 233 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:31,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 259 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-21 17:56:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 210. [2022-07-21 17:56:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 186 states have (on average 1.39247311827957) internal successors, (259), 189 states have internal predecessors, (259), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 287 transitions. [2022-07-21 17:56:31,020 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 287 transitions. Word has length 35 [2022-07-21 17:56:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:31,021 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 287 transitions. [2022-07-21 17:56:31,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 287 transitions. [2022-07-21 17:56:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:56:31,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:31,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:31,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:31,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:31,231 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:31,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash 758626562, now seen corresponding path program 1 times [2022-07-21 17:56:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:31,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284127539] [2022-07-21 17:56:31,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:31,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:31,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:31,234 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:31,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 17:56:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:31,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 17:56:31,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:31,347 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-21 17:56:31,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:31,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:31,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284127539] [2022-07-21 17:56:31,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284127539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:31,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:31,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:56:31,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059519065] [2022-07-21 17:56:31,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:31,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:31,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:31,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:31,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:31,355 INFO L87 Difference]: Start difference. First operand 210 states and 287 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:31,403 INFO L93 Difference]: Finished difference Result 208 states and 283 transitions. [2022-07-21 17:56:31,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:31,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-07-21 17:56:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:31,405 INFO L225 Difference]: With dead ends: 208 [2022-07-21 17:56:31,405 INFO L226 Difference]: Without dead ends: 208 [2022-07-21 17:56:31,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-21 17:56:31,406 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 5 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:31,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 470 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-21 17:56:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-07-21 17:56:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.3837837837837839) internal successors, (256), 187 states have internal predecessors, (256), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2022-07-21 17:56:31,412 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 39 [2022-07-21 17:56:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:31,412 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2022-07-21 17:56:31,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2022-07-21 17:56:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 17:56:31,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:31,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:31,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:31,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:31,623 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:31,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash 143802726, now seen corresponding path program 1 times [2022-07-21 17:56:31,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:31,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983150532] [2022-07-21 17:56:31,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:31,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:31,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:31,625 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:31,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 17:56:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:31,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:56:31,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:31,776 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-21 17:56:31,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:31,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:31,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983150532] [2022-07-21 17:56:31,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983150532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:31,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:31,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:56:31,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890634954] [2022-07-21 17:56:31,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:31,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:56:31,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:31,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:56:31,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:56:31,778 INFO L87 Difference]: Start difference. First operand 208 states and 283 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:31,932 INFO L93 Difference]: Finished difference Result 224 states and 301 transitions. [2022-07-21 17:56:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:56:31,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-21 17:56:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:31,934 INFO L225 Difference]: With dead ends: 224 [2022-07-21 17:56:31,934 INFO L226 Difference]: Without dead ends: 207 [2022-07-21 17:56:31,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:56:31,935 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 179 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:31,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1016 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-21 17:56:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-21 17:56:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 186 states have internal predecessors, (254), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 281 transitions. [2022-07-21 17:56:31,940 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 281 transitions. Word has length 37 [2022-07-21 17:56:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:31,941 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 281 transitions. [2022-07-21 17:56:31,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 281 transitions. [2022-07-21 17:56:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 17:56:31,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:31,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:31,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:32,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:32,158 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:32,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:32,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1174329751, now seen corresponding path program 1 times [2022-07-21 17:56:32,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:32,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456330648] [2022-07-21 17:56:32,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:32,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:32,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:32,161 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:32,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 17:56:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:32,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:56:32,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:32,309 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-21 17:56:32,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:32,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:32,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456330648] [2022-07-21 17:56:32,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456330648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:32,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:32,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:56:32,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436981880] [2022-07-21 17:56:32,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:32,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:56:32,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:32,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:56:32,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:56:32,312 INFO L87 Difference]: Start difference. First operand 207 states and 281 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:32,440 INFO L93 Difference]: Finished difference Result 223 states and 299 transitions. [2022-07-21 17:56:32,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:56:32,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-21 17:56:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:32,441 INFO L225 Difference]: With dead ends: 223 [2022-07-21 17:56:32,441 INFO L226 Difference]: Without dead ends: 206 [2022-07-21 17:56:32,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:56:32,442 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 51 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:32,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1166 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:32,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-21 17:56:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-07-21 17:56:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 183 states have (on average 1.3770491803278688) internal successors, (252), 185 states have internal predecessors, (252), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 279 transitions. [2022-07-21 17:56:32,448 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 279 transitions. Word has length 38 [2022-07-21 17:56:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:32,448 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 279 transitions. [2022-07-21 17:56:32,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 279 transitions. [2022-07-21 17:56:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 17:56:32,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:32,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:32,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:32,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:32,651 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:32,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash -461855063, now seen corresponding path program 1 times [2022-07-21 17:56:32,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:32,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736634312] [2022-07-21 17:56:32,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:32,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:32,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:32,653 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:32,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 17:56:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:32,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:56:32,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:32,801 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-21 17:56:32,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:32,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736634312] [2022-07-21 17:56:32,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736634312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:32,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:32,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:56:32,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300653823] [2022-07-21 17:56:32,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:32,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:56:32,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:32,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:56:32,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:56:32,803 INFO L87 Difference]: Start difference. First operand 206 states and 279 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:32,904 INFO L93 Difference]: Finished difference Result 215 states and 288 transitions. [2022-07-21 17:56:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:56:32,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-21 17:56:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:32,906 INFO L225 Difference]: With dead ends: 215 [2022-07-21 17:56:32,906 INFO L226 Difference]: Without dead ends: 186 [2022-07-21 17:56:32,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:56:32,907 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 51 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:32,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1152 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-21 17:56:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-21 17:56:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 163 states have (on average 1.3742331288343559) internal successors, (224), 165 states have internal predecessors, (224), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 251 transitions. [2022-07-21 17:56:32,912 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 251 transitions. Word has length 38 [2022-07-21 17:56:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:32,913 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 251 transitions. [2022-07-21 17:56:32,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:56:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 251 transitions. [2022-07-21 17:56:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:56:32,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:32,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:32,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:33,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:33,115 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:33,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:33,115 INFO L85 PathProgramCache]: Analyzing trace with hash -233541237, now seen corresponding path program 1 times [2022-07-21 17:56:33,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:33,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623044669] [2022-07-21 17:56:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:33,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:33,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:33,117 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:33,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 17:56:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:33,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:56:33,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:33,232 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-21 17:56:33,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:33,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:33,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623044669] [2022-07-21 17:56:33,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623044669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:33,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:33,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:56:33,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399445164] [2022-07-21 17:56:33,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:33,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:56:33,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:33,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:56:33,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:33,235 INFO L87 Difference]: Start difference. First operand 186 states and 251 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:33,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:33,249 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2022-07-21 17:56:33,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:56:33,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-07-21 17:56:33,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:33,251 INFO L225 Difference]: With dead ends: 179 [2022-07-21 17:56:33,251 INFO L226 Difference]: Without dead ends: 179 [2022-07-21 17:56:33,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:56:33,252 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 16 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:33,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 891 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-21 17:56:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-07-21 17:56:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 156 states have (on average 1.3717948717948718) internal successors, (214), 158 states have internal predecessors, (214), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 241 transitions. [2022-07-21 17:56:33,257 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 241 transitions. Word has length 41 [2022-07-21 17:56:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:33,258 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 241 transitions. [2022-07-21 17:56:33,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 241 transitions. [2022-07-21 17:56:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:56:33,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:33,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:33,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-21 17:56:33,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:33,469 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:33,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash 348485743, now seen corresponding path program 1 times [2022-07-21 17:56:33,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:33,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294850736] [2022-07-21 17:56:33,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:33,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:33,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:33,475 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:33,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-21 17:56:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:33,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:56:33,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:33,667 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-21 17:56:33,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:33,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:33,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294850736] [2022-07-21 17:56:33,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294850736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:33,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:33,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:56:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274497571] [2022-07-21 17:56:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:33,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:56:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:33,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:56:33,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:56:33,669 INFO L87 Difference]: Start difference. First operand 179 states and 241 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:33,839 INFO L93 Difference]: Finished difference Result 178 states and 238 transitions. [2022-07-21 17:56:33,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:56:33,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-07-21 17:56:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:33,841 INFO L225 Difference]: With dead ends: 178 [2022-07-21 17:56:33,841 INFO L226 Difference]: Without dead ends: 178 [2022-07-21 17:56:33,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:56:33,842 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 238 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:33,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 672 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-21 17:56:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-21 17:56:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.3612903225806452) internal successors, (211), 157 states have internal predecessors, (211), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-21 17:56:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 238 transitions. [2022-07-21 17:56:33,846 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 238 transitions. Word has length 42 [2022-07-21 17:56:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:33,846 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 238 transitions. [2022-07-21 17:56:33,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 238 transitions. [2022-07-21 17:56:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:56:33,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:33,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:33,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:34,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:34,048 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1096582801, now seen corresponding path program 1 times [2022-07-21 17:56:34,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:34,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015083878] [2022-07-21 17:56:34,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:34,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:34,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:34,051 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:34,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 17:56:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:34,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:56:34,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:34,238 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-21 17:56:34,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:34,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:34,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015083878] [2022-07-21 17:56:34,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015083878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:34,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:34,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:56:34,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859653262] [2022-07-21 17:56:34,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:34,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:56:34,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:34,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:56:34,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:56:34,240 INFO L87 Difference]: Start difference. First operand 178 states and 238 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:34,453 INFO L93 Difference]: Finished difference Result 231 states and 302 transitions. [2022-07-21 17:56:34,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:56:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-07-21 17:56:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:34,454 INFO L225 Difference]: With dead ends: 231 [2022-07-21 17:56:34,455 INFO L226 Difference]: Without dead ends: 218 [2022-07-21 17:56:34,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:56:34,455 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 208 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:34,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1183 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:56:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-21 17:56:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 187. [2022-07-21 17:56:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 166 states have internal predecessors, (220), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-21 17:56:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 249 transitions. [2022-07-21 17:56:34,461 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 249 transitions. Word has length 42 [2022-07-21 17:56:34,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:34,462 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 249 transitions. [2022-07-21 17:56:34,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 249 transitions. [2022-07-21 17:56:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 17:56:34,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:34,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:56:34,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:34,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:34,672 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1105542194, now seen corresponding path program 1 times [2022-07-21 17:56:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:34,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235890574] [2022-07-21 17:56:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:34,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:34,674 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:34,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-21 17:56:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:34,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 17:56:34,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:34,774 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-21 17:56:34,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:34,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:34,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235890574] [2022-07-21 17:56:34,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235890574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:34,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:34,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:56:34,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494461488] [2022-07-21 17:56:34,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:34,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:34,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:34,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:34,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:34,776 INFO L87 Difference]: Start difference. First operand 187 states and 249 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:34,786 INFO L93 Difference]: Finished difference Result 188 states and 249 transitions. [2022-07-21 17:56:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:34,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-21 17:56:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:34,788 INFO L225 Difference]: With dead ends: 188 [2022-07-21 17:56:34,788 INFO L226 Difference]: Without dead ends: 187 [2022-07-21 17:56:34,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-21 17:56:34,789 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:34,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-21 17:56:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-21 17:56:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 163 states have (on average 1.343558282208589) internal successors, (219), 166 states have internal predecessors, (219), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-21 17:56:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 248 transitions. [2022-07-21 17:56:34,794 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 248 transitions. Word has length 48 [2022-07-21 17:56:34,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:34,794 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 248 transitions. [2022-07-21 17:56:34,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 248 transitions. [2022-07-21 17:56:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:56:34,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:34,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:56:34,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:35,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:35,010 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:35,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:35,011 INFO L85 PathProgramCache]: Analyzing trace with hash 437296472, now seen corresponding path program 1 times [2022-07-21 17:56:35,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:35,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526346908] [2022-07-21 17:56:35,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:35,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:35,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:35,013 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:35,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-21 17:56:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:35,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 17:56:35,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:35,114 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-21 17:56:35,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:35,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:35,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526346908] [2022-07-21 17:56:35,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526346908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:35,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:35,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:56:35,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505670209] [2022-07-21 17:56:35,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:35,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:56:35,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:35,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:56:35,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:56:35,117 INFO L87 Difference]: Start difference. First operand 187 states and 248 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:35,125 INFO L93 Difference]: Finished difference Result 188 states and 248 transitions. [2022-07-21 17:56:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:56:35,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-21 17:56:35,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:35,127 INFO L225 Difference]: With dead ends: 188 [2022-07-21 17:56:35,127 INFO L226 Difference]: Without dead ends: 187 [2022-07-21 17:56:35,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-21 17:56:35,128 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:35,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:56:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-21 17:56:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-21 17:56:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 163 states have (on average 1.3312883435582823) internal successors, (217), 166 states have internal predecessors, (217), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-21 17:56:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 246 transitions. [2022-07-21 17:56:35,133 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 246 transitions. Word has length 49 [2022-07-21 17:56:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:35,133 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 246 transitions. [2022-07-21 17:56:35,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2022-07-21 17:56:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:56:35,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:35,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:56:35,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:35,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:35,344 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:35,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash 364909914, now seen corresponding path program 1 times [2022-07-21 17:56:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:35,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979312842] [2022-07-21 17:56:35,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:35,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:35,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:35,346 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:35,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-21 17:56:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:35,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 17:56:35,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:35,552 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-21 17:56:35,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:35,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:35,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979312842] [2022-07-21 17:56:35,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979312842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:35,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:35,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:56:35,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190069400] [2022-07-21 17:56:35,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:35,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:56:35,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:35,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:56:35,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:56:35,555 INFO L87 Difference]: Start difference. First operand 187 states and 246 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:35,770 INFO L93 Difference]: Finished difference Result 232 states and 299 transitions. [2022-07-21 17:56:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:56:35,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-21 17:56:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:35,772 INFO L225 Difference]: With dead ends: 232 [2022-07-21 17:56:35,772 INFO L226 Difference]: Without dead ends: 221 [2022-07-21 17:56:35,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:56:35,773 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 135 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:35,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1682 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:56:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-21 17:56:35,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 190. [2022-07-21 17:56:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 165 states have (on average 1.3272727272727274) internal successors, (219), 168 states have internal predecessors, (219), 15 states have call successors, (15), 8 states have call predecessors, (15), 9 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-21 17:56:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 249 transitions. [2022-07-21 17:56:35,778 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 249 transitions. Word has length 49 [2022-07-21 17:56:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:35,779 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 249 transitions. [2022-07-21 17:56:35,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 249 transitions. [2022-07-21 17:56:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:56:35,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:35,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:35,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:35,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:35,990 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1169166180, now seen corresponding path program 1 times [2022-07-21 17:56:35,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:35,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520634737] [2022-07-21 17:56:35,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:35,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:35,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:35,992 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:35,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-21 17:56:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:36,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:56:36,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:36,214 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-21 17:56:36,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:36,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:36,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520634737] [2022-07-21 17:56:36,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520634737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:36,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:36,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:56:36,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582871302] [2022-07-21 17:56:36,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:36,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:56:36,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:36,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:56:36,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:56:36,216 INFO L87 Difference]: Start difference. First operand 190 states and 249 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:56:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:36,296 INFO L93 Difference]: Finished difference Result 190 states and 247 transitions. [2022-07-21 17:56:36,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:56:36,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-21 17:56:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:36,298 INFO L225 Difference]: With dead ends: 190 [2022-07-21 17:56:36,298 INFO L226 Difference]: Without dead ends: 190 [2022-07-21 17:56:36,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:56:36,298 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 188 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:36,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 366 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-21 17:56:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-07-21 17:56:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 165 states have (on average 1.3151515151515152) internal successors, (217), 168 states have internal predecessors, (217), 15 states have call successors, (15), 8 states have call predecessors, (15), 9 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-21 17:56:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2022-07-21 17:56:36,303 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 45 [2022-07-21 17:56:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:36,303 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2022-07-21 17:56:36,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:56:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2022-07-21 17:56:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:56:36,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:36,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:36,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:36,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:36,514 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:36,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:36,514 INFO L85 PathProgramCache]: Analyzing trace with hash -648920610, now seen corresponding path program 1 times [2022-07-21 17:56:36,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:36,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882706200] [2022-07-21 17:56:36,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:36,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:36,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:36,516 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:36,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-21 17:56:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:36,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:56:36,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:36,699 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-21 17:56:36,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:36,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:36,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882706200] [2022-07-21 17:56:36,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882706200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:36,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:36,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:56:36,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604938144] [2022-07-21 17:56:36,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:36,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:56:36,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:36,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:56:36,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:56:36,701 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:36,854 INFO L93 Difference]: Finished difference Result 214 states and 274 transitions. [2022-07-21 17:56:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:56:36,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-07-21 17:56:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:36,856 INFO L225 Difference]: With dead ends: 214 [2022-07-21 17:56:36,856 INFO L226 Difference]: Without dead ends: 202 [2022-07-21 17:56:36,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:56:36,857 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 27 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:36,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1613 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-21 17:56:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 196. [2022-07-21 17:56:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 174 states have internal predecessors, (222), 15 states have call successors, (15), 8 states have call predecessors, (15), 10 states have return successors, (18), 13 states have call predecessors, (18), 11 states have call successors, (18) [2022-07-21 17:56:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 255 transitions. [2022-07-21 17:56:36,862 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 255 transitions. Word has length 43 [2022-07-21 17:56:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:36,862 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 255 transitions. [2022-07-21 17:56:36,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 255 transitions. [2022-07-21 17:56:36,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:56:36,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:36,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:36,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:37,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:37,072 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:37,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:37,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1043867234, now seen corresponding path program 1 times [2022-07-21 17:56:37,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:37,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206428517] [2022-07-21 17:56:37,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:37,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:37,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:37,076 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:37,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-21 17:56:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:37,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:56:37,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:37,250 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-21 17:56:37,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:37,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:37,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206428517] [2022-07-21 17:56:37,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206428517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:37,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:37,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:56:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510967803] [2022-07-21 17:56:37,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:37,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:56:37,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:37,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:56:37,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:56:37,252 INFO L87 Difference]: Start difference. First operand 196 states and 255 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:37,375 INFO L93 Difference]: Finished difference Result 207 states and 265 transitions. [2022-07-21 17:56:37,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:56:37,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-07-21 17:56:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:37,376 INFO L225 Difference]: With dead ends: 207 [2022-07-21 17:56:37,377 INFO L226 Difference]: Without dead ends: 191 [2022-07-21 17:56:37,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:56:37,377 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 30 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:37,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1425 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-21 17:56:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2022-07-21 17:56:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 161 states have (on average 1.31055900621118) internal successors, (211), 164 states have internal predecessors, (211), 14 states have call successors, (14), 8 states have call predecessors, (14), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-21 17:56:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 239 transitions. [2022-07-21 17:56:37,382 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 239 transitions. Word has length 43 [2022-07-21 17:56:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:37,382 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 239 transitions. [2022-07-21 17:56:37,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 239 transitions. [2022-07-21 17:56:37,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:56:37,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:37,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:37,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:37,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:37,592 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:37,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1608018874, now seen corresponding path program 1 times [2022-07-21 17:56:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:37,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653711726] [2022-07-21 17:56:37,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:37,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:37,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:37,594 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:37,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-21 17:56:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:37,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:56:37,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:37,780 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-21 17:56:37,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:37,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:37,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653711726] [2022-07-21 17:56:37,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653711726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:37,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:37,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:56:37,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353036071] [2022-07-21 17:56:37,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:37,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:56:37,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:37,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:56:37,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:56:37,782 INFO L87 Difference]: Start difference. First operand 185 states and 239 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:37,963 INFO L93 Difference]: Finished difference Result 210 states and 265 transitions. [2022-07-21 17:56:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:56:37,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-07-21 17:56:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:37,965 INFO L225 Difference]: With dead ends: 210 [2022-07-21 17:56:37,965 INFO L226 Difference]: Without dead ends: 198 [2022-07-21 17:56:37,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:56:37,966 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 177 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:37,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1316 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-21 17:56:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2022-07-21 17:56:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 161 states have (on average 1.31055900621118) internal successors, (211), 164 states have internal predecessors, (211), 14 states have call successors, (14), 8 states have call predecessors, (14), 9 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2022-07-21 17:56:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 238 transitions. [2022-07-21 17:56:37,971 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 238 transitions. Word has length 43 [2022-07-21 17:56:37,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:37,971 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 238 transitions. [2022-07-21 17:56:37,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:56:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 238 transitions. [2022-07-21 17:56:37,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 17:56:37,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:37,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:56:37,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:38,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:38,182 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1614034079, now seen corresponding path program 1 times [2022-07-21 17:56:38,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:38,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096252569] [2022-07-21 17:56:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:38,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:38,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:38,184 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:38,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-21 17:56:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:38,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 17:56:38,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:38,375 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-21 17:56:38,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:38,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:38,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096252569] [2022-07-21 17:56:38,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096252569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:38,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:38,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:56:38,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687868577] [2022-07-21 17:56:38,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:38,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:56:38,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:38,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:56:38,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:56:38,377 INFO L87 Difference]: Start difference. First operand 185 states and 238 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:38,510 INFO L93 Difference]: Finished difference Result 211 states and 267 transitions. [2022-07-21 17:56:38,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:56:38,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-07-21 17:56:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:38,512 INFO L225 Difference]: With dead ends: 211 [2022-07-21 17:56:38,512 INFO L226 Difference]: Without dead ends: 200 [2022-07-21 17:56:38,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:56:38,512 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 19 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:38,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1651 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:38,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-21 17:56:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 191. [2022-07-21 17:56:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 170 states have internal predecessors, (216), 14 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2022-07-21 17:56:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 246 transitions. [2022-07-21 17:56:38,517 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 246 transitions. Word has length 50 [2022-07-21 17:56:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:38,517 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 246 transitions. [2022-07-21 17:56:38,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 246 transitions. [2022-07-21 17:56:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 17:56:38,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:38,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:56:38,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:38,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:38,719 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash 27450463, now seen corresponding path program 1 times [2022-07-21 17:56:38,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:38,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230723669] [2022-07-21 17:56:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:38,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:38,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:38,721 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:38,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-21 17:56:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:56:38,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 17:56:38,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:56:38,928 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-21 17:56:38,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:56:38,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:56:38,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230723669] [2022-07-21 17:56:38,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230723669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:56:38,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:56:38,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:56:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435340226] [2022-07-21 17:56:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:56:38,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:56:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:56:38,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:56:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:56:38,932 INFO L87 Difference]: Start difference. First operand 191 states and 246 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:56:39,071 INFO L93 Difference]: Finished difference Result 200 states and 255 transitions. [2022-07-21 17:56:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:56:39,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-07-21 17:56:39,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:56:39,072 INFO L225 Difference]: With dead ends: 200 [2022-07-21 17:56:39,072 INFO L226 Difference]: Without dead ends: 167 [2022-07-21 17:56:39,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:56:39,073 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 16 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:56:39,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1844 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:56:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-21 17:56:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2022-07-21 17:56:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 136 states have (on average 1.2794117647058822) internal successors, (174), 139 states have internal predecessors, (174), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2022-07-21 17:56:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 198 transitions. [2022-07-21 17:56:39,077 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 198 transitions. Word has length 50 [2022-07-21 17:56:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:56:39,077 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 198 transitions. [2022-07-21 17:56:39,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:56:39,077 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 198 transitions. [2022-07-21 17:56:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:56:39,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:56:39,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:39,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:39,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:39,279 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:56:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:56:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash -825515977, now seen corresponding path program 1 times [2022-07-21 17:56:39,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:56:39,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898440192] [2022-07-21 17:56:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:56:39,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:56:39,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:56:39,281 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:56:39,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-21 17:56:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 17:56:39,343 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 17:56:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 17:56:39,429 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-21 17:56:39,429 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 17:56:39,430 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-21 17:56:39,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-21 17:56:39,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-21 17:56:39,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:56:39,645 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:56:39,647 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 17:56:39,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:56:39 BoogieIcfgContainer [2022-07-21 17:56:39,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 17:56:39,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 17:56:39,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 17:56:39,745 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 17:56:39,745 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:56:26" (3/4) ... [2022-07-21 17:56:39,749 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 17:56:39,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 17:56:39,749 INFO L158 Benchmark]: Toolchain (without parser) took 15073.22ms. Allocated memory was 54.5MB in the beginning and 130.0MB in the end (delta: 75.5MB). Free memory was 30.6MB in the beginning and 73.9MB in the end (delta: -43.2MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2022-07-21 17:56:39,750 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 54.5MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:56:39,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.41ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 30.5MB in the beginning and 49.1MB in the end (delta: -18.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-07-21 17:56:39,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.28ms. Allocated memory is still 73.4MB. Free memory was 49.1MB in the beginning and 45.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:56:39,750 INFO L158 Benchmark]: Boogie Preprocessor took 40.50ms. Allocated memory is still 73.4MB. Free memory was 45.7MB in the beginning and 43.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:56:39,751 INFO L158 Benchmark]: RCFGBuilder took 906.69ms. Allocated memory is still 73.4MB. Free memory was 42.8MB in the beginning and 52.4MB in the end (delta: -9.6MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2022-07-21 17:56:39,751 INFO L158 Benchmark]: TraceAbstraction took 13646.72ms. Allocated memory was 73.4MB in the beginning and 130.0MB in the end (delta: 56.6MB). Free memory was 51.7MB in the beginning and 74.9MB in the end (delta: -23.3MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2022-07-21 17:56:39,751 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 130.0MB. Free memory was 74.9MB in the beginning and 73.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:56:39,752 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 54.5MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.41ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 30.5MB in the beginning and 49.1MB in the end (delta: -18.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.28ms. Allocated memory is still 73.4MB. Free memory was 49.1MB in the beginning and 45.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.50ms. Allocated memory is still 73.4MB. Free memory was 45.7MB in the beginning and 43.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 906.69ms. Allocated memory is still 73.4MB. Free memory was 42.8MB in the beginning and 52.4MB in the end (delta: -9.6MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13646.72ms. Allocated memory was 73.4MB in the beginning and 130.0MB in the end (delta: 56.6MB). Free memory was 51.7MB in the beginning and 74.9MB in the end (delta: -23.3MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 130.0MB. Free memory was 74.9MB in the beginning and 73.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1013]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1013. Possible FailurePath: [L23] int KernelMode ; [L24] int Executive ; [L25] int DevicePowerState ; [L26] int s ; [L27] int UNLOADED ; [L28] int NP ; [L29] int DC ; [L30] int SKIP1 ; [L31] int SKIP2 ; [L32] int MPR1 ; [L33] int MPR3 ; [L34] int IPC ; [L35] int pended ; [L36] int compFptr ; [L37] int compRegistered ; [L38] int lowerDriverReturn ; [L39] int setEventCalled ; [L40] int customIrp ; [L41] int myStatus ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L294] int status ; [L295] int irp = __VERIFIER_nondet_int() ; [L296] int pirp ; [L297] int pirp__IoStatus__Status ; [L298] int irp_choice = __VERIFIER_nondet_int() ; [L299] int devobj = __VERIFIER_nondet_int() ; [L300] int __cil_tmp8 ; [L302] KernelMode = 0 [L303] Executive = 0 [L304] DevicePowerState = 1 [L305] s = 0 [L306] UNLOADED = 0 [L307] NP = 0 [L308] DC = 0 [L309] SKIP1 = 0 [L310] SKIP2 = 0 [L311] MPR1 = 0 [L312] MPR3 = 0 [L313] IPC = 0 [L314] pended = 0 [L315] compFptr = 0 [L316] compRegistered = 0 [L317] lowerDriverReturn = 0 [L318] setEventCalled = 0 [L319] customIrp = 0 [L320] myStatus = 0 [L324] status = 0 [L325] pirp = irp [L326] CALL _BLAST_init() [L61] UNLOADED = 0 [L62] NP = 1 [L63] DC = 2 [L64] SKIP1 = 3 [L65] SKIP2 = 4 [L66] MPR1 = 5 [L67] MPR3 = 6 [L68] IPC = 7 [L69] s = UNLOADED [L70] pended = 0 [L71] compFptr = 0 [L72] compRegistered = 0 [L73] lowerDriverReturn = 0 [L74] setEventCalled = 0 [L75] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L326] RET _BLAST_init() [L328] COND TRUE status >= 0 [L329] s = NP [L330] customIrp = 0 [L331] setEventCalled = customIrp [L332] lowerDriverReturn = setEventCalled [L333] compRegistered = lowerDriverReturn [L334] pended = compRegistered [L335] pirp__IoStatus__Status = 0 [L336] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, irp=9, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L337] COND TRUE irp_choice == 0 [L338] pirp__IoStatus__Status = -1073741637 [L339] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L342] CALL stub_driver_init() [L47] s = NP [L48] pended = 0 [L49] compFptr = 0 [L50] compRegistered = 0 [L51] lowerDriverReturn = 0 [L52] setEventCalled = 0 [L53] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L342] RET stub_driver_init() [L345] COND FALSE !(status < 0) [L349] int tmp_ndt_1; [L350] tmp_ndt_1 = __VERIFIER_nondet_int() [L351] COND FALSE !(tmp_ndt_1 == 0) [L354] int tmp_ndt_2; [L355] tmp_ndt_2 = __VERIFIER_nondet_int() [L356] COND FALSE !(tmp_ndt_2 == 1) [L359] int tmp_ndt_3; [L360] tmp_ndt_3 = __VERIFIER_nondet_int() [L361] COND TRUE tmp_ndt_3 == 3 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L388] CALL, EXPR KbFilter_PnP(devobj, pirp) [L80] int devExt ; [L81] int irpStack ; [L82] int status ; [L83] int event = __VERIFIER_nondet_int() ; [L84] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L85] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L86] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L87] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L88] int devExt__Started ; [L89] int devExt__Removed ; [L90] int devExt__SurpriseRemoved ; [L91] int Irp__IoStatus__Status ; [L92] int Irp__IoStatus__Information ; [L93] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L94] int irpSp ; [L95] int nextIrpSp ; [L96] int nextIrpSp__Control ; [L97] int irpSp___0 ; [L98] int irpSp__Context ; [L99] int irpSp__Control ; [L100] long __cil_tmp23 ; [L103] status = 0 [L104] devExt = DeviceObject__DeviceExtension [L105] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L106] COND FALSE !(irpStack__MinorFunction == 0) VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L109] COND FALSE !(irpStack__MinorFunction == 23) VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L112] COND TRUE irpStack__MinorFunction == 2 VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L236] devExt__Removed = 1 VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, devExt__Removed=1, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L237] COND TRUE s == NP [L238] s = SKIP1 VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, devExt__Removed=1, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L245] Irp__CurrentLocation ++ [L246] Irp__Tail__Overlay__CurrentStackLocation ++ VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, devExt__Removed=1, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L247] CALL IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L483] int returnVal2 ; [L484] int compRetStatus ; [L485] int lcontext = __VERIFIER_nondet_int() ; [L486] long long __cil_tmp7 ; VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L489] COND FALSE !(\read(compRegistered)) VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L502] int tmp_ndt_6; [L503] tmp_ndt_6 = __VERIFIER_nondet_int() [L504] COND FALSE !(tmp_ndt_6 == 0) [L507] int tmp_ndt_7; [L508] tmp_ndt_7 = __VERIFIER_nondet_int() [L509] COND TRUE tmp_ndt_7 == 1 VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=2147483648, tmp_ndt_7=1, UNLOADED=0] [L518] returnVal2 = -1073741823 VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=2147483648, tmp_ndt_7=1, UNLOADED=0] [L528] COND FALSE !(s == NP) VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=2147483648, tmp_ndt_7=1, UNLOADED=0] [L532] COND FALSE !(s == MPR1) VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=2147483648, tmp_ndt_7=1, UNLOADED=0] [L541] COND TRUE s == SKIP1 [L542] s = SKIP2 [L543] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=2147483648, tmp_ndt_7=1, UNLOADED=0] [L551] return (returnVal2); VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, \result=-1073741823, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=2147483648, tmp_ndt_7=1, UNLOADED=0] [L247] RET IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, devExt__Removed=1, devExt__TopOfStack=11, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IofCallDriver(devExt__TopOfStack, Irp)=-1073741823, IPC=7, Irp=9, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L248] status = 0 VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, devExt__Removed=1, devExt__TopOfStack=11, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L290] return (status); VAL [\old(DeviceObject)=8, \old(Irp)=9, \result=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, devExt__Removed=1, devExt__TopOfStack=11, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L388] RET, EXPR KbFilter_PnP(devobj, pirp) [L388] status = KbFilter_PnP(devobj, pirp) [L412] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L420] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L428] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L429] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L430] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L440] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L447] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L452] COND TRUE status != lowerDriverReturn VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L453] CALL errorFn() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1013] reach_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - UnprovableResult [Line: 293]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 210 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3760 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3736 mSDsluCounter, 21794 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15469 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2305 IncrementalHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 6325 mSDtfsCounter, 2305 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 966 GetRequests, 836 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=6, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 191 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 930 ConstructedInterpolants, 0 QuantifiedInterpolants, 2953 SizeOfPredicates, 65 NumberOfNonLiveVariables, 3475 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-21 17:56:39,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample